Computing by Self-Reproduction: Autopoietic Automata

0339978 - ÚI 2010 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
Wiedermann, Jiří
Computing by Self-Reproduction: Autopoietic Automata.
Unconventional Computation. Berlin: Springer, 2005 - (Calude, C.; Dinneen, M.; Paun, G.; Pérez-Jiménez, M.; Rozenberg, G.), s. 224-236. Lecture Notes in Computer Science, 3699. ISBN 3-540-29100-8.
[UC 2005. International Conference on Unconventional Computation /4./. Sevilla (ES), 03.10.2005-07.10.2005]
Grant CEP: GA AV ČR 1ET100300517
Výzkumný záměr: CEZ:AV0Z10300504
Klíčová slova: self-reproduction * cellular automata * autopoietic automata * computation * artificial life
Kód oboru RIV: IN - Informatika

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 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. We show that the computational power of lineages of autopoietic automata is equal to that of an interactive nondeterministic Turing Machine.
Trvalý link: http://hdl.handle.net/11104/0183329