Compressing Elementary Cellular Automaton Rules

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.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

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

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.