Elementary Cellular Automata with Short Initial Condition

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Elementary cellular automata (ECA) rules with class III (randomness) patterns can evolve as class I (dies out) with a sufficiently short random initial condition. A few of these rules are 18, 22, 122, 126, 129, 146, 151, 161, 182, and 183.


This Demonstration shows 18 different random initial conditions side by side, each with a 30-cell initial condition.


Contributed by: Daniel de Souza Carvalho (August 2015)
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.