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
Physically Based, Self-Organizing Cellular Automata
Selected Papers from the 4th Australian Workshop on Distributed Artificial Intelligence, Multi-Agent Systems: Theories, Languages, and Applications
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
A broader view on the limitations of information processing and communication by nature
Natural Computing: an international journal
Autopoietic automata: Complexity issues in offspring-producing evolving processes
Theoretical Computer Science
| Hi-index | 0.00 |
We present two original computational models — globular universe and autopoietic automata — capturing the basic aspects of an evolution: a construction of self–reproducing automata by self–assembly and a transfer of algorithmically modified genetic information over generations. Within this framework we show implementation of autopoietic automata in a globular universe. Further, we characterize the computational power of lineages of autopoietic automata via interactive Turing machines and show an unbounded complexity growth of a computational power of automata during the evolution. Finally, we define the problem of sustainable evolution and show its undecidability.