Selfish Elementary Cellular Automata
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
A selfish automaton uses its initial conditions as its current rule. The result is then used as the new initialization and the new rule, and so on. Most elementary 8-bit selfish automata reach fixed points quickly, but number 118 evolves 15 generations. Evolutions of all possible 8-bit initializations are plotted by converting all their 8-bit states into the integers between 0 and 255. Select an initialization/rule to see the red line trace its evolution.
Contributed by: Michael Schreiber (March 2011)
Open content licensed under CC BY-NC-SA
"Selfish Elementary Cellular Automata"
Wolfram Demonstrations Project
Published: March 7 2011