Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F07%3A00085028" target="_blank" >RIV/67985807:_____/07:00085028 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes
Original language description
We introduce a new formal computational model designed for studying the information transfer among the generations of offspring-producing evolving machines so-called autopoietic automata. These can be seen as nondeterministic finite state transducers whose "program" can become a subject of their own processing. An autopoietic automaton can algorithmically generate an offspring controlled by a program which is a modification of its parent?s program. Autopoietic automata offer a neat framework for investigating computational and complexity issues in the evolutionary self-reproducing processes. We show that the computational power of lineages of autopoietic automata is equal to that of an interactive nondeterministic Turing machine. We also prove that there exists an autopoietic automaton giving rise to an unlimited evolution, provided that suitable inputs are delivered to individual automata. However, the problem of sustainable evolution, asking whether for an arbitrary autopoietic autom
Czech name
Autopoietické automaty: složitostní aspekty evolučních sebereprodukčních procesů.
Czech description
Navrhujeme tzv. autopoietické automaty, které představují nový výpočetní model vhodný pro studium přenosu genetické informace v potomstvu evolučních zařízení. Autopoietické automaty poskytují vhodný rámec pro studium výpočetních a složitostních aspektů evolučních sebereprodukujících se procesů.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET100300517" target="_blank" >1ET100300517: Methods for Intelligent Systems and Their Applications in Datamining and Natural Language Processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
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
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
383
Issue of the periodical within the volume
2-3
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
10
Pages from-to
260-269
UT code for WoS article
—
EID of the result in the Scopus database
—