Abstract
We continue the investigation of P colonies introduced in , a class [8] of abstract computing devices composed of independent membrane agents, acting and evolving in a shared environment.
We decrease the number of agents sufficient to guarantee computational completeness of P colonies with one and with two objects inside each agent, respectively, owing some special restrictions to the type of programs. We characterize the generative power of the partially blind machine by the generative power of special P colonies.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ciencialová, L., Cienciala, L.: Variations on the theme: P colonies. In: Kolář, D., Meduna, A. (eds.) Proceedings of the 1st International workshop WFM 2006, Ostrava, pp. 27–34 (2006)
Csuhaj-Varjú, E., Kelemen, J., Kelemenová, A., Păun, G., Vaszil, G.: Cells in environment: P colonies. Journal of Multiple-valued Logic and Soft Computing 12(3-4), 201–215 (2006)
Csuhaj-Varjú, E., Margenstern, M., Vaszil, G.: P colonies with a bounded number of cells and programs. In: Hoogeboom, H.J., Păun, G., Rozenberg, G. (eds.) Pre-Proceedings of the 7th Workshop on Membrane Computing, Leiden, the Netherlands, pp. 311–322 (2006)
Freund, R., Oswald, M.: P colonies working in the maximally parallel and in the sequential mode. In: Ciobanu, G., Păun, G. (eds.) Pre-Proceedings of the 1st International Workshop on Theory and Application of P Systems, Timisoara, Romania, pp. 49–56 (2005)
Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science 7(1), 311–324 (1978)
Kelemen, J., Kelemenová, A.: A grammar-theoretic treatment of multi-agent systems. Cybernetics and Systems 23, 621–633 (1992)
Kelemen, J., Kelemenová, A.: On P colonies, a biochemically inspired model of computation. In: Proc. of the 6th International Symposium of Hungarian Researchers on Computational Intelligence, Budapest TECH, Hungary, pp. 40–56 (2005)
Kelemen, J., Kelemenová, A., Păun, G.: Preview of P colonies: A biochemically inspired computing model. In: Bedau, M., et al. (eds.) ALIFE IX. Workshop and Tutorial Proceedings, Ninth International Conference on the Simulation and Synthesis of Living Systems, Boston, Mass., pp. 82–86 (2004)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, NJ (1967)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000)
Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)
P systems web page. http://psystems.disco.unimib.it
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cienciala, L., Ciencialová, L., Kelemenová, A. (2007). On the Number of Agents in P Colonies. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2007. Lecture Notes in Computer Science, vol 4860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77312-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-77312-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77311-5
Online ISBN: 978-3-540-77312-2
eBook Packages: Computer ScienceComputer Science (R0)