Skip to main content

Turing Completeness Using Three Mobile Membranes

  • Conference paper
Unconventional Computation (UC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5715))

Included in the following conference series:

Abstract

The mutual mobile membrane systems represent a variant of mobile membrane systems in which the endocytosis and exocytosis work whenever the involved membranes “agree” on the movement (this agreement is described by using dual objects a and \(\overline{a}\) in the involved membranes). We study the computational power of this variant of mobile membrane systems, proving that only three membranes are enough to get the same computational power as a Turing machine.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell, 5th edn. Garland Science. Taylor & Francis, Abington (2008)

    Google Scholar 

  2. Aman, B., Ciobanu, G.: Describing the Immune System Using Enhanced Mobile Membranes. Electronic Notes in Theoretical Computer Science 194, 5–18 (2008)

    Article  MATH  Google Scholar 

  3. Aman, B., Ciobanu, G.: Simple, Enhanced and Mutual Mobile Membranes. In: Transactions on Computational Systems Biology. Springer, Heidelberg (to appear, 2009)

    Google Scholar 

  4. Cardelli, L.: Brane Calculi - Interactions of Biological Membranes. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–278. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Cardelli, L., Păun, G.: An Universality Result for a (Mem)Brane Calculus Based on Mate/Drip Operations. International Journal of Foundations of Computer Science 17, 49–68 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Heidelberg (1990)

    MATH  Google Scholar 

  7. Freund, R., Păun, G.: On the Number of Non-terminals in Graph-Controlled, Programmed, and Matrix Grammars. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 214–225. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Krishna, S.N., Ciobanu, G.: On the Computational Power of Enhanced Mobile Membranes. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 326–335. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Krishna, S.N., Păun, G.: P Systems with Mobile Membranes. Natural Computing 4, 255–274 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Minsky, M.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  12. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  13. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, London (1980)

    MATH  Google Scholar 

  14. Salomaa, A.: Formal Languages. Academic Press, London (1973)

    MATH  Google Scholar 

  15. Schroeppel, R.: A Two Counter Machine Cannot Calculate 2N. Massachusetts Institute of Technology, A.I. Laboratory, Artificial Intelligence Memo #257 (1972)

    Google Scholar 

  16. Webpage, http://bcs.whfreeman.com/thelifewire

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aman, B., Ciobanu, G. (2009). Turing Completeness Using Three Mobile Membranes. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds) Unconventional Computation. UC 2009. Lecture Notes in Computer Science, vol 5715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03745-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03745-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03744-3

  • Online ISBN: 978-3-642-03745-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics