All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On the robust power of morphogenetic systems for time bounded computation

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-319-73359-3_18#aboutcontent" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-73359-3_18#aboutcontent</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-73359-3_18" target="_blank" >10.1007/978-3-319-73359-3_18</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the robust power of morphogenetic systems for time bounded computation

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

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

  • Continuities

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

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Lecture Notes in Computer Science

  • ISBN

    9783319733593

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    23

  • Pages from-to

    270-292

  • Publisher name

    Springer Verlag

  • Place of publication

    Cham

  • Event location

    Bradford, United Kingdom

  • Event date

    Jan 1, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article