P Colonies with a Bounded Number of Cells and Programs
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.
KeywordsTuring Machine Bounded Number Register Machine Membrane Computing Internal Object
Unable to display preview. Download preview PDF.
- 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
- 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