Generalized P Colonies with passive environment
|Department||Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial|
|Abstract||We study two variants of P colonies with initial content of P colony and
so called passive environment: P colonies with two objects inside each agent that can
only consume or generate objects, and P colonies with one ...
We study two variants of P colonies with initial content of P colony and so called passive environment: P colonies with two objects inside each agent that can only consume or generate objects, and P colonies with one object inside each agent using rewriting and communication rules. We show that the rst kind of P colonies with one consumer agent and one sender agent can generate all sets of natural numbers computed by register machines, and hence they are computationally universal in the Turing sense. Similarly, also the second kind of systems with three agents with rewriting/consuming rules is computationally complete. The paper improves previously published universality results concerning generalized P colonies, and it also extends our knowledge about very simple multi-agent systems capable of universal computation.
|Citation||Ciencialová, L., Cienciala, L. y Sosík, P. (2016). Generalized P Colonies with passive environment. En BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, E. T. S. de Ingeniería Informática, February 1-5 (151-162), Sevilla: Fénix.|