Skip to main content

P Colonies with a Bounded Number of Cells and Programs

  • Conference paper
Membrane Computing (WMC 2006)

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

Included in the following conference series:

Abstract

We continue the investigation of P colonies, a class of abstract computing devices composed of very simple agents (computational tools), acting and evolving in a shared environment. We show that if P colonies are initialized by placing a number of copies of a certain object in the environment, then they can generate any recursively enumerable set of numbers with a bounded number of cells, each cell containing a bounded number of programs (of bounded length), for constant bounds.

This publication was supported by the Hungarian Foundation for Research and Technological Innovation (project no. TéT F-19/04) and the EGIDE in France (project no. Balaton 09000TC, year 2005) in the frame of the Hungarian-French Intergovernmental Scientific and Technological Cooperation. The work of Erzsébet Csuhaj-Varjú and György Vaszil was also supported by the Hungarian Scientific Research Fund “OTKA” grant no. T 042529.

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. Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems – A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)

    MATH  Google Scholar 

  2. Csuhaj-Varjú, E., Kelemen, J., Kelemenová, A., Păun, G., Vaszil, G.: Computing with cells in environment: P colonies. Journal of Multiple Valued Logic and Soft Computing (to appear)

    Google Scholar 

  3. Kelemen, J., Kelemenová, A.: A grammar-theoretic treatment of multi-agent systems. Cybernetics and Systems 23, 621–633 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kelemen, J., Kelemenová, A., Păun, G.: Preview of P colonies: A biochemically inspired computing model. In: Bedau, M., et al. (eds.) Workshop and Tutorial Proceedings. Ninth International Conference on the Simulation and Synthesis of Living Systems (Alife IX), Boston, Mass, pp. 82–86 (2004)

    Google Scholar 

  5. Korec, I.: Small universal register machines. Theoretical Computer Science 168, 267–301 (1996)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csuhaj-Varjú, E., Margenstern, M., Vaszil, G. (2006). P Colonies with a Bounded Number of Cells and Programs. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2006. Lecture Notes in Computer Science, vol 4361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963516_22

Download citation

  • DOI: https://doi.org/10.1007/11963516_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69088-7

  • Online ISBN: 978-3-540-69090-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics