Autopoietic automata: Complexity issues in offspring-producing evolving processes

  • Wiedermann J
  • 6

    Readers

    Mendeley users who have this article in their library.
  • 3

    Citations

    Citations of this article.

Abstract

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. © 2007 Elsevier Ltd. All rights reserved.

Author-supplied keywords

  • Autopoietic automata
  • Computational complexity
  • Interactive Turing machine
  • Self-reproducing automata
  • Simulation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Jiří Wiedermann

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free