Computing by Self-Reproduction: Autopoietic Automata

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F05%3A00339978" target="_blank" >RIV/67985807:_____/05:00339978 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Computing by Self-Reproduction: Autopoietic Automata

Original language description

We introduce a new formal computational model designed for studying the information transfer among the generations of offspring-producing machines - so-called autopoietic automata. These can be seen as finite state transducers whose "program" can becomea 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. We show that the computational power of lineages of autopoietic automata is equal to that of an interactive nondeterministic Turing Machine.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

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)

Publication year

2005

Confidentiality

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

Article name in the collection

Unconventional Computation

ISBN

3-540-29100-8

ISSN

—

e-ISSN

—

Number of pages

13

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin

Event location

Sevilla

Event date

Oct 3, 2005

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000233391700021