Wolfram Research

Mathematica MathWorld Wolfram Science More »

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.


	Contributed by: Daniel de Souza Carvalho
	Show Initialization Code

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

"Compressing Elementary Cellular Automaton Rules" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/CompressingElementaryCellularAutomatonRules/

Contributed by: Daniel de Souza Carvalho

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Related Topics

Browse all topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

Powered by Wolfram Mathematica

Give us your feedback

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

© 2009 Wolfram Demonstrations Project & Contributors

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+