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.