Skip to main content

Computational Complexity Aspects in Membrane Computing

  • Conference paper
Programs, Proofs, Processes (CiE 2010)

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

Included in the following conference series:

Abstract

Within the framework of membrane systems, distributed parallel computing models inspired by the functioning of the living cell, various computational complexity classes have been defined, which can be compared against the computational complexity classes defined for Turing machines. Here some issues and results concerning computational complexity of membrane systems are discussed. In particular, we focus our attention on the comparison among complexity classes for membrane systems with active membranes (where new membranes can be created by division of membranes which exist in the system in a given moment) and the classes PSPACE, EXP, and EXPSPACE.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

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

    MathSciNet  Google Scholar 

  2. Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J.: P systems with active membranes, without polarizations and without dissolution: a characterization of P. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 105–116. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Krishna, S.N., Rama, R.: A variant of P systems with active membranes: Solving NP-complete problems. Romanian J. of Information Science and Technology 2(4), 357–367 (1999)

    Google Scholar 

  4. Leporati, A., Zandron, C., Ferretti, C., Mauri, G.: On the Computational Power of Spiking Neural P Systems. Intern. J. of Unconventional Computing 5(5), 459–473 (2009)

    Google Scholar 

  5. Leporati, A., Mauri, G., Zandron, C., Păun, G., Pérez-Jiménez, M.J.: Uniform Solutions to SAT and Subset Sum by Spiking Neural P Systems. Natural Computing 8(4), 681–702 (2009)

    Article  MATH  Google Scholar 

  6. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1993)

    Google Scholar 

  7. Păun, G.: Computing with membranes. J. of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MATH  Google Scholar 

  8. Păun, G.: P systems with active membranes: attacking NP complete problems. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds.) Unconventional Models of Computation, pp. 94–115. Springer, London (2000)

    Google Scholar 

  9. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  10. Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2009)

    Google Scholar 

  11. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity Classes in Cellular Computing with Membranes. Natural Computing 2(3), 265–285 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: The P versus NP problem through cellular computing with membranes. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 338–352. Springer, Heidelberg (2004)

    Google Scholar 

  13. Porreca, A.E., Mauri, G., Zandron, C.: Complexity classes for membrane systems. RAIRO Theoretical Informatics and Applications 40(2), 141–162 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  14. Porreca, A.E., Mauri, G., Zandron, C.: Non-confluence in divisionless P systems with active membranes. Theoretical Computer Science 411(6), 878–887 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sosík, P.: The computational power of cell division in P systems: Beating down parallel computers? Natural Computing 2(3), 287–298 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. 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.) Unconventional Models of Computation, pp. 289–301. Springer, London (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mauri, G., Leporati, A., Porreca, A.E., Zandron, C. (2010). Computational Complexity Aspects in Membrane Computing. In: Ferreira, F., Löwe, B., Mayordomo, E., Mendes Gomes, L. (eds) Programs, Proofs, Processes. CiE 2010. Lecture Notes in Computer Science, vol 6158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13962-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13962-8_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13961-1

  • Online ISBN: 978-3-642-13962-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics