Membrane computing and complexity theory: A characterization of PSPACE

A P system is a natural computing model inspired by information processing in cells and cellular membranes. We show that confluent P systems with active membranes solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems prove to be equivalent (up to a polynomial time reduction) to the alternating Turing machine or the PRAM computer. Similar results were achieved also with other models of natural computation, such as DNA computing or genetic algorithms. Our result, together with the previous observations, suggests that the class PSPACE provides a tight upper bound on the computational potential of biological information processing models.

[1]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[2]  Giancarlo Mauri,et al.  Solving NP-Complete Problems Using P Systems with Active Membranes , 2000, UMC.

[3]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[4]  Florent Jacquemard,et al.  An Analysis of a Public Key Protocol with Membranes , 2005 .

[5]  Jan van Leeuwen,et al.  Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[6]  Gabriel Ciobanu,et al.  P systems with minimal parallelism , 2007, Theor. Comput. Sci..

[7]  Evgeny Dantsin,et al.  A Robust Dna Computation Model That Captures Pspace , 2003, Int. J. Found. Comput. Sci..

[8]  Pavel Pudlák.  Complexity Theory and Genetics: The Computational Power of Crossing Over , 2001, Inf. Comput..

[9]  P. Boas.  Machine models and simulations , 1991 .

[10]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[11]  Gabriel Ciobanu,et al.  Applications of Membrane Computing , 2006, Applications of Membrane Computing.

[12]  Petr Sosík.  The computational power of cell division in P systems: Beating down parallel computers? , 2004, Natural Computing.

[13]  Gheorghe Paun,et al.  Applications of Membrane Computing (Natural Computing Series) , 2005 .

[14]  Yuval Rabani,et al.  Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) , 1994, STOC '94.

[15]  Mario J. Pérez-Jiménez,et al.  Characterizing Tractability by Cell-Like Membrane Systems , 2007, Formal Models, Languages and Applications.

[16]  Donald Beaver,et al.  A universal molecular computer , 1995, DNA Based Computers.

[17]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[18]  Mario J. Pérez-Jiménez,et al.  Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.

[19]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[20]  Peter van Emde Boas,et al.  Machine Models and Simulation , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[21]  Artiom Alhazov,et al.  Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes , 2003, Fundam. Informaticae.

[22]  M. J. P. Jiménez,et al.  On the power of dissolution in p systems with active membranes , 2005 .

[23]  Mario J. Pérez-Jiménez,et al.  On the Power of Dissolution in P Systems with Active Membranes , 2005, Workshop on Membrane Computing.

[24]  Giancarlo Mauri,et al.  Complexity classes for membrane systems , 2006, RAIRO Theor. Informatics Appl..

[25]  Alfonso Rodríguez-Patón,et al.  Tissue P systems , 2003, Theor. Comput. Sci..