On the number of agents in P colonies

Authors:
Luděk Cienciala;Lucie Ciencialová;Alica Kelemenová
Affiliations:
Institute of Computer Science, Silesian University in Opava, Czech Republic;Institute of Computer Science, Silesian University in Opava, Czech Republic;Institute of Computer Science, Silesian University in Opava, Czech Republic and Department of Computer Science, Catholic University Ružomberok, Slovakia
Venue:
WMC'07 Proceedings of the 8th international conference on Membrane computing
Year:
2007

Citing 6
Cited 2

A grammar-theoretic treatment of multiagent systems

Cybernetics and Systems
Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computation: finite and infinite machines

Computation: finite and infinite machines
P Colonies Working in the Maximally Parallel and in the Sequential Mode

SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
P colonies with a bounded number of cells and programs

WMC'06 Proceedings of the 7th 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 introduced in [8], a class of abstract computing devices composed of independent membrane agents, acting and evolving in a shared environment. We decrease the number of agents sufficient to guarantee computational completeness of P colonies with one and with two objects inside each agent, respectively, owing some special restrictions to the type of programs. We characterize the generative power of the partially blind machine by the generative power of special P colonies.