An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes

DOI10.1007/978-3-642-11467-0_31zbMath1273.68138DBLPconf/membrane/ValsecchiPLMZ09OpenAlexW1883842167WikidataQ57518512 ScholiaQ57518512MaRDI QIDQ5851925

Alberto Leporati, Antonio E. Porreca, Andrea Valsecchi, Giancarlo Mauri, Claudio Zandron

Publication date: 26 January 2010

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11467-0_31

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (7)

P Systems Simulating Oracle Computations ⋮ Non-confluence in divisionless P systems with active membranes ⋮ Evaluating space measures in P systems ⋮ Space complexity equivalence of P systems with active membranes and Turing machines ⋮ Selected Topics in Computational Complexity of Membrane Systems ⋮ Subroutines in P systems and closure properties of their complexity classes ⋮ P systems attacking hard problems beyond NP: a survey

This page was built for publication: An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes