Abstract
P systems with proteins on membranes are inspired closely by switching protein channels. This model of membrane computing using membrane division has been previously shown to solve an NP-complete problem in polynomial time. In this paper we characterize the class of problems solvable by these P systems in polynomial time and we show that it equals PSPACE. Therefore, these P systems are computationally equivalent (up to a polynomial time reduction) to the alternating Turing machine or the PRAM computer. The proof technique we employ reveals also some interesting trade-offs between certain P system properties, as antiport rules, membrane labeling by polarization or the presence of proteins.
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
Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell, 4th edn. Garland Science, New York (2002)
Alhazov, A., Martín-Vide, C., Pan, L.: Solving a PSPACE-complete problem by P systems with restricted active membranes. Fundamenta Informaticae 58(2), 67–77 (2003)
Cardelli, L.: Brane calculi – interactions of biological membranes. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–280. Springer, Heidelberg (2005)
Frisco, P.: Computing with Cells. In: Advances in Membrane Computing. Oxford University Press, Oxford (2009)
Păun, A., Păun, G.: The power of communication: P systems with symport/antiport. New Generation Comput. 20(3), 295–306 (2002)
Păun, A., Popa, B.: P systems with proteins on membranes. Fundamenta Informaticae 72(4), 467–483 (2006)
Păun, A., Popa, B.: P systems with proteins on membranes and membrane division. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 292–303. Springer, Heidelberg (2006)
Păun, G.: Membrane Computing – An Introduction. Springer, Berlin (2002)
Pérez-Jiménez, M.J.: A computational complexity theory in membrane computing. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núnez, A. (eds.) Tenth Workshop on Membrane Computing (WMC10), RGNC Report 3/2009, Sevilla, pp. 82–105. Universidad de Sevilla (2009)
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. J. Comput. System Sci. 73(1), 137–152 (2007)
van Emde Boas, P.: Machine models and simulations. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 1–66. Elsevier, Amsterdam (1990)
The P systems web page, http://ppage.psystems.eu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sosík, P., Păun, A., Rodríguez-Patón, A., Pérez, D. (2010). On the Power of Computing with Proteins on Membranes. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2009. Lecture Notes in Computer Science, vol 5957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11467-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-11467-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11466-3
Online ISBN: 978-3-642-11467-0
eBook Packages: Computer ScienceComputer Science (R0)