Generalized P colonies with passive environment

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F18%3AA0000210" target="_blank" >RIV/47813059:19240/18:A0000210 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S030439751730899X" target="_blank" >https://www.sciencedirect.com/science/article/pii/S030439751730899X</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2017.12.009" target="_blank" >10.1016/j.tcs.2017.12.009</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Generalized P colonies with passive environment

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Generalized P colonies with passive environment

Popis výsledku anglicky

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.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Svazek periodika

724

Číslo periodika v rámci svazku

9 May 2018

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

8

Strana od-do

61-68

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85038824647