WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Compressing Elementary Cellular Automaton Rules

rule
The compressibility of cellular automaton (CA) patterns is related to the CA complexity according to the CA's classification: class 3, class 4, class 2, and class 1, in order of increasing compressibility. The graphic shows how many bytes are required to store the CA rules with 70 steps and 70 initial random condition sizes; the rules are ordered according to their compressibility.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.