Abstract
Mobile membranes represent a variant of membrane systems in which the main operations are inspired by the biological operations of endocytosis and exocytosis. We study the computational power of mobile membranes, proving an optimal computability result: three membranes are enough to have the same computational power as a Turing machine. Regarding the computational complexity, we present a semi-uniform polynomial solution for a strong NP-complete problem (SAT problem) by using only endocytosis, exocytosis and elementary division.
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
Aman, B., Ciobanu, G.: On the relationship between membranes and ambients. Biosystems 91, 515–530 (2008)
Aman, B., Ciobanu, G.: Simple, enhanced and mutual mobile membranes. Transactions on Computational Systems Biology XI, 26–44 (2009)
Aman, B., Ciobanu, G.: Turing completeness using three mobile membranes. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds.) UC 2009. LNCS, vol. 5715, pp. 42–55. Springer, Heidelberg (2009)
Aman, B., Ciobanu, G.: Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems. Acta Informatica 48, 409–415 (2011)
Aman, B., Ciobanu, G.: Coordinating parallel mobile ambients to solve SAT problem in polynomial number of steps. In: Sirjani, M. (ed.) COORDINATION 2012. LNCS, vol. 7274, pp. 122–136. Springer, Heidelberg (2012)
Busi, N., Zavattaro, G.: On the expressive power of movement and restriction in pure mobile ambients. Theoretical Computer Science 322, 477–515 (2004)
Cardelli, L., Gordon, A.: Mobile ambients. Theoretical Computer Science 240, 177–213 (2000)
Cardelli, L.: Brane calculi. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–278. Springer, Heidelberg (2005)
Ciobanu, G., Krishna, S.: Enhanced mobile membranes: computability results. Theory of Computing Systems 48, 715–729 (2011)
Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman (1979)
Ibarra, O., Păun, A., Păun, G., Rodríguez-Patón, A., Sosík, P., Woodworth, S.: Normal forms for spiking neural P systems. Theoretical Computer Science 372, 196–217 (2007)
Krishna, S., Păun, G.: P systems with mobile membranes. Natural Computing 4, 255–274 (2005)
Krishna, S.N.: The power of mobility: Four membranes suffice. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 242–251. Springer, Heidelberg (2005)
Minsky, M.: Finite and Infinite Machines. Prentice-Hall (1967)
Păun, G.: Membrane Computing. An Introduction. Springer (2002)
Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press (2010)
Pérez-Jiménez, M., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity - membrane division, membrane creation. In: [16] (2010)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press (1980)
Salomaa, A.: Formal Languages. Academic Press (1973)
Schroeppel, R.: A Two Counter Machine Cannot Calculate 2N. Massachusetts Institute of Technology, Artificial Intelligence Memo no.257 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aman, B., Ciobanu, G. (2013). Mobile Membranes: Computability and Complexity. In: Liu, Z., Woodcock, J., Zhu, H. (eds) Theoretical Aspects of Computing – ICTAC 2013. ICTAC 2013. Lecture Notes in Computer Science, vol 8049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39718-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-39718-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39717-2
Online ISBN: 978-3-642-39718-9
eBook Packages: Computer ScienceComputer Science (R0)