John von Neumann and the evolutionary growth of complexity: looking backward, looking forward …
Artificial Life - Special issue on the Artificial Life VII: looking backward, looking forward
Beyond the Turing Limit: Evolving Interactive Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Thirty years of computational autopoiesis: a review
Artificial Life
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Globular universe and autopoietic automata: a framework for artificial life
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
| Hi-index | 5.23 |
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 automaton and arbitrary inputs there is an infinite lineage of its offspring, is undecidable.