P systems simulating oracle computations

13Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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 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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Porreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2012). P systems simulating oracle computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7184 LNCS, pp. 346–358). https://doi.org/10.1007/978-3-642-28024-5_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free