Abstract
We show how existing P systems with active membranes can be used as modules inside a larger P system; this allows us to simulate subroutines or oracles. As an application of this construction, which is (in principle) quite general, we provide a new, improved lower bound to the complexity class PMC \(_{\mathcal{AM}(-{\rm d},-{\rm n})}\) of problems solved by polynomial-time P systems with (restricted) elementary active membranes: this class is proved to contain P PP and hence, by Toda’s theorem, the whole polynomial hierarchy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alhazov, A., Martín-Vide, C., Pan, L.: Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes. Fundamenta Informaticae 58(2), 67–77 (2003)
Murphy, N., Woods, D.: The computational power of membrane systems under tight uniformity conditions. Natural Computing 10(1), 613–632 (2011)
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity classes in models of cellular computing with membranes. Natural Computing 2(3), 265–284 (2003)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Elementary active membranes have the power of counting. In: Martínez-del-Amor, M.A., Păun, G., Pérez-Hurtado, I., Romero-Campero, F.J., Valencia-Cabrera, L. (eds.) Ninth Brainstorming Week on Membrane Computing, No. 1/2011 in RGNC Reports, Fénix Editora, pp. 329–342 (2011), http://www.gcn.us.es/9BWMC/volume/24Porreca.pdf
Păun, G.: P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)
Sosík, P.: The computational power of cell division in P systems: Beating down parallel computers? Natural Computing 2(3), 287–298 (2003)
Sosík, P., Rodríguez-Patón, A.: Membrane computing and complexity theory: A characterization of PSPACE. Journal of Computer and System Sciences 73(1), 137–152 (2007)
Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20(5), 865–877 (1991)
Valsecchi, A., Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 461–478. Springer, Heidelberg (2010)
Zandron, C., Ferretti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds.) Proceedings of the Second International Conference Unconventional Models of Computation, UMC 2K, pp. 289–301. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C. (2012). P Systems Simulating Oracle Computations. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds) Membrane Computing. CMC 2011. Lecture Notes in Computer Science, vol 7184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28024-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-28024-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28023-8
Online ISBN: 978-3-642-28024-5
eBook Packages: Computer ScienceComputer Science (R0)