Homogeneous P Colonies

We study P colonies introduced in (8) as a class of abstract computing devices composed of independent membrane agents, acting and evolving in a shared environment. In the present paper especially P colonies are considered, which are homogeneous with respect to the type of rules in each program of agents. The number of agents, as well as the number of programs in each agent are bounded, which are sufficient to guarantee computational completeness of homoge- neous P colonies. We present results for P colonies with one and with two objects inside each agent.

[1]  Rudolf Freund,et al.  P colonies working in the maximally parallel and in the sequential mode , 2005, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05).

[2]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[3]  Jozef Kelemen,et al.  On P Colonies, a Simple Bio-Chemically Inspired Model of Computation , 2005 .

[4]  Erzsébet Csuhaj-Varjú,et al.  Computing with Cells in Environment: P Colonies , 2006, J. Multiple Valued Log. Soft Comput..

[5]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[6]  Erzsébet Csuhaj-Varjú,et al.  P Colonies with a Bounded Number of Cells and Programs , 2006, Workshop on Membrane Computing.

[7]  Jozef Kelemen,et al.  A grammar-theoretic treatment of multiagent systems , 1992 .

[8]  Ludek Cienciala,et al.  On the Number of Agents in P Colonies , 2007, Workshop on Membrane Computing.

[9]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..