P colonies with a bounded number of cells and programs

Authors:
Erzsébet Csuhaj-Varjú;Maurice Margenstern;György Vaszil
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary;LITA, Université Paul Verlaine – Metz, Metz Cedex 1, France;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary
Venue:
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Year:
2006

Citing 5
Cited 3

A grammar-theoretic treatment of multiagent systems

Cybernetics and Systems
Small universal register machines

Theoretical Computer Science - Special issue on universal machines and computations
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computation: finite and infinite machines

Computation: finite and infinite machines

On the number of agents in P colonies

WMC'07 Proceedings of the 8th international conference on Membrane computing
P colonies and their extensions

Computation, cooperation, and life
Modularity in p colonies with checking rules

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

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.