Machine models and simulations
Handbook of theoretical computer science (vol. A)
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Complexity theory and genetics: the compuational power of crossing over
Information and Computation
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Theoretical Computer Science
Complexity classes in models of cellular computing with membranes
Natural Computing: an international journal
The computational power of cell division in P systems: Beating down parallel computers?
Natural Computing: an international journal
Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes
Fundamenta Informaticae
Applications of Membrane Computing (Natural Computing Series)
Applications of Membrane Computing (Natural Computing Series)
On the power of dissolution in p systems with active membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
A Characterisation of NL Using Membrane Systems without Charges and Dissolution
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Membrane Dissolution and Division in P
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Active membrane systems without charges and using only symmetric elementary division characterise P
WMC'07 Proceedings of the 8th international conference on Membrane computing
Computational complexity aspects in membrane computing
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
P systems with elementary active membranes: beyond NP and coNP
CMC'10 Proceedings of the 11th international conference on Membrane computing
The computational power of membrane systems under tight uniformity conditions
Natural Computing: an international journal
Selected topics in computational complexity of membrane systems
Computation, cooperation, and life
A computational complexity theory in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
On the power of computing with proteins on membranes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
P systems simulating oracle computations
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Tissue p systems with cell separation: upper bound by PSPACE
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Limits of the power of tissue p systems with cell division
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Space complexity equivalence of P systems with active membranes and Turing machines
Theoretical Computer Science
| Hi-index | 0.00 |
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.