Selfish Elementary Cellular Automata

Initializing live version
Download to Desktop

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




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.