P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
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
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
The computational power of membrane systems under tight uniformity conditions
Natural Computing: an international journal
An efficient simulation of polynomial-space turing machines by p systems with active 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
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
Fundamenta Informaticae
Sublinear-Space p systems with active membranes
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 5.23 |
We prove that arbitrary single-tape Turing machines can be simulated by uniform families of P systems with active membranes with a cubic slowdown and quadratic space overhead. This result is the culmination of a series of previous partial results, finally establishing the equivalence (up to a polynomial) of many space complexity classes defined in terms of P systems and Turing machines. The equivalence we obtained also allows a number of classic computational complexity theorems, such as Savitch's theorem and the space hierarchy theorem, to be directly translated into statements about membrane systems.