Other formats:
BibTeX
LaTeX
RIS
@article{29036, author = {Ciencialová, Lucie and Cienciala, Luděk and Sosík, Petr}, article_location = {Amsterdam}, article_number = {9 May 2018}, doi = {http://dx.doi.org/10.1016/j.tcs.2017.12.009}, keywords = {computatuinal completeness; P colony; Register machine}, language = {eng}, issn = {0304-3975}, journal = {Theoretical Computer Science}, title = {Generalized P colonies with passive environment}, url = {https://www.sciencedirect.com/science/article/pii/S030439751730899X}, volume = {724}, year = {2018} }
TY - JOUR ID - 29036 AU - Ciencialová, Lucie - Cienciala, Luděk - Sosík, Petr PY - 2018 TI - Generalized P colonies with passive environment JF - Theoretical Computer Science VL - 724 IS - 9 May 2018 SP - 61-68 EP - 61-68 PB - Elsevier SN - 0304-3975 KW - computatuinal completeness KW - P colony KW - Register machine UR - https://www.sciencedirect.com/science/article/pii/S030439751730899X L2 - https://www.sciencedirect.com/science/article/pii/S030439751730899X N2 - 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 first 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 complete in the Turing sense. Similarly, also the second kind of systems with three agents with rewriting/communication rules is computationally complete. The paper improves previously published universality results concerning generalized P colonies, and it also extends the knowledge about very simple multi-agent systems capable of universal computation. ER -
CIENCIALOVÁ, Lucie, Luděk CIENCIALA and Petr SOSÍK. Generalized P colonies with passive environment. \textit{Theoretical Computer Science}. Amsterdam: Elsevier, 2018, vol.~724, 9 May 2018, p.~61-68. ISSN~0304-3975. Available from: https://dx.doi.org/10.1016/j.tcs.2017.12.009.
|