Ordinary Membrane Machines versus Other Mathematical Models of Systems Realizing Massively Parallel Computations

Abstract

A comparison of ordinary membrane machines, understood as certain recursive families of deterministic P systems, with some other mathematical models of systems realizing massively parallel computations is discussed. These mathematical models are those which respect recursiveness of computational tasks of systems, i.e., the functions to be computed are recursive functions and the decision problems correspond to recursive sets. The comparison together with open problems is summarized in the enclosed tables, where open problems are indicated by question mark “?”.