Compressing Elementary Cellular Automaton Rules
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
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.
Contributed by: Daniel de Souza Carvalho (March 2011)
Open content licensed under CC BY-NC-SA
The compression algorithm converts the CA rule pattern into a compressed string, according to the Compress function in Mathematica.
"Compressing Elementary Cellular Automaton Rules"
Wolfram Demonstrations Project
Published: March 7 2011