2018
On the robust power of morphogenetic systems for time bounded computation
SOSÍK, Petr; Vladimír SMOLKA; Jan DRASTIK; Jaroslav BRADÍK; Max H. GARZÓN et al.Základní údaje
Originální název
On the robust power of morphogenetic systems for time bounded computation
Autoři
SOSÍK, Petr; Vladimír SMOLKA; Jan DRASTIK; Jaroslav BRADÍK a Max H. GARZÓN
Vydání
volume 10725. Cham, Lecture Notes in Computer Science, od s. 270-292, 23 s. 2018
Nakladatel
Springer Verlag
Další údaje
Jazyk
angličtina
Typ výsledku
Stať ve sborníku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Německo
Utajení
není předmětem státního či obchodního tajemství
Forma vydání
elektronická verze "online"
Odkazy
Impakt faktor
Impact factor: 0.402 v roce 2005
Označené pro přenos do RIV
Ano
Kód RIV
RIV/47813059:19240/18:A0000084
Organizační jednotka
Filozoficko-přírodovědecká fakulta v Opavě
ISBN
978-3-319-73359-3
ISSN
EID Scopus
Klíčová slova anglicky
Membrane computing; Probabilistic complexity; Atomic components; Bounded computation; Cell divisions; Geometric constraint; Living organisms; Local interactions
Štítky
Příznaky
Mezinárodní význam, Recenzováno
Návaznosti
LQ1602, projekt VaV.
Změněno: 26. 3. 2018 08:48, Mgr. Kamil Matula, Ph.D.
Anotace
V originále
The time appears ripe to enrich the original idea of membrane computing with principles of self-assembly in space. To this effect, a first step was taken with the introduction of a new such family of models M systems (for morphogenetic system) that own a number of basic macro-properties exhibited by higher living organisms (such as self-assembly, cell division akin to mitosis and self-healing), while still only leveraging local interactions of simple atomic components and explicit geometric constraints of their constituting elements. Here we further demonstrate that, experimentally in silico, M systems are in general also capable of demonstrating these properties robustly after being assembled from scratch from some atomic components and entering a homeostatic regime. The results are obtained through a series of experiments carried out with an M system simulator designed to implement this kind of model by researchers interested in exploring new capabilities. We further define probabilistic complexity classes for M systems and we show that the model is theoretically capable of solving NP-complete problems in P-time, despite apparent problems of an implementation, such as kinetic and concentration bottlenecks.