turing automata

1. There seems to be an analogy to Turing’s machine on a very abstract scale found in evolution. Circular machines reach a finite point, or a wall at which there is no possible next move. Similarly, however, over a longer period of time and perhaps without such concrete results evolution renders a ‘circular’ species extinct. The vast majority of species are ‘circle-free’. The ‘circle-free’ species are influenced by the immediately (relative time wise) preceding configuration. For example, since humans no longer have a rough diet of tough to digest plant material, humans no longer need the appendix to aid in our digestion. The ‘0’ or blank space in our code has been erased and our code has been transformed into one that is more compact and efficient.

2. Cellular automata have no geometrical aspects. They can be assigned to run on any type of geometry with the same sets of rules.