3.8 Article

Evaluating space measures in P systems

Journal

JOURNAL OF MEMBRANE COMPUTING
Volume 4, Issue 3, Pages 251-260

Publisher

SPRINGERNATURE
DOI: 10.1007/s41965-022-00106-5

Keywords

Membrane systems; Computational complexity; Space complexity

Funding

  1. Universita degli Studi di Milano-Bicocca, Fondo di Ateneo per la Ricerca 2019 [2019-ATE-0454]
  2. National Agency for Research and Development [20.80009.5007.22]

Ask authors/readers for more resources

This paper discusses the definition of space complexity in P systems with active membranes. It reviews the main results related to solving computationally hard problems and highlights the requirement of different resources in each solution. Possible alternative solutions requiring different resources are also discussed.
P systems with active membranes are a variant of P systems where membranes can be created by division of existing membranes, thus creating an exponential amount of resources in a polynomial number of steps. Time and space complexity classes for active membrane systems have been introduced, to characterize classes of problems that can be solved by different membrane systems making use of different resources. In particular, space complexity classes introduced initially considered a hypothetical real implementation by means of biochemical materials, assuming that every single object or membrane requires some constant physical space (corresponding to unary notation). A different approach considered implementation of P systems in silico, allowing to store the multiplicity of each object in each membrane using binary numbers. In both cases, the elements contributing to the definition of the space required by a system (namely, the total number of membranes, the total number of objects, the types of different membranes, and the types of different objects) was considered as a whole. In this paper, we consider a different definition for space complexity classes in the framework of P systems, where each of the previous elements is considered independently. We review the principal results related to the solution of different computationally hard problems presented in the literature, highlighting the requirement of every single resource in each solution. A discussion concerning possible alternative solutions requiring different resources is presented.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available