Compressing Elementary Cellular Automaton Rules

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.

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


Snapshots


Details

The compression algorithm converts the CA rule pattern into a compressed string, according to the Compress function in Mathematica.



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.
Send