P Systems with Active Membranes Characterize PSPACE

A P system is a natural computing model inspired by information processes in cells and a control role of cellular membranes. We show that uniform families of P systems with active membranes are able to solve, in polynomial time, exactly the class of decisional problems PSPACE. Similar results were achieved also with other models of bio-inspired computers, such as DNA computing. Together they suggest that PSPACE naturally characterizes the computational potential of biological information processing.

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

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

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

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

[5]  José L. Balcázar,et al.  Structural complexity 2 , 1990 .

[6]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

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

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

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

[10]  Jan van Leeuwen,et al.  Array processing machines , 1985, FCT.

[11]  P. van Emde Boas.  The second machine class: models of parallelism , 1985 .

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

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

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

[15]  Artiom Alhazov,et al.  One and two polarizations, membrane creation and objects complexity in P systems , 2005, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05).

[16]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[17]  Leslie M. Goldschlager,et al.  A universal interconnection pattern for parallel computers , 1982, JACM.

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

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