Graph automata: natural expression of self-reproduction

摘要: Abstract A variety of models self-reproduction process have been proposed since von Neumann initiated this field with his self-reproducing automata. Almost all them are described within the framework two-dimensional cellular They heavily dependent on or limited by peculiar properties lattice spaces. But such irrelevant to essential nature self-replication. In paper, we introduce a new called “graph automata” obtain natural description complicated spatio-temporal developmental processes as self-reproduction. The most advantageous point methodology is that it not restricted particular space. As an illustrative example, Turing machine, which requires very long conventional automata, shown in simple and straightforward formulation. Graph automata provide tool approach important scientific problems evolution morphology, also give basis self-repairing artifacts.