Structural complexity 2
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
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
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
On the power of dissolution in p systems with active membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
| Hi-index | 0.00 |
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.