D 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.

Basic information

Original name

On the robust power of morphogenetic systems for time bounded computation

Authors

SOSÍK, Petr; Vladimír SMOLKA; Jan DRASTIK; Jaroslav BRADÍK and Max H. GARZÓN

Edition

volume 10725. Cham, Lecture Notes in Computer Science, p. 270-292, 23 pp. 2018

Publisher

Springer Verlag

Other information

Language

English

Type of outcome

Proceedings paper

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

is not subject to a state or trade secret

Publication form

electronic version available online

References:

Impact factor

Impact factor: 0.402 in 2005

Marked to be transferred to RIV

Yes

RIV identification code

RIV/47813059:19240/18:A0000084

Organization unit

Faculty of Philosophy and Science in Opava

ISBN

978-3-319-73359-3

ISSN

EID Scopus

Keywords in English

Membrane computing; Probabilistic complexity; Atomic components; Bounded computation; Cell divisions; Geometric constraint; Living organisms; Local interactions

Tags

Tags

International impact, Reviewed

Links

LQ1602, research and development project.
Changed: 26/3/2018 08:48, Mgr. Kamil Matula, Ph.D.

Abstract

In the original language

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.

Files attached

Sosik-Smolka-Drastik-Bradik-Garzon_On-the-Robust-Power-of-Morphogenetic-Systems-for-Time-Bounded-Computation.pdf
Request the author's version of the file