Wolfram Research

Mathematica MathWorld Wolfram Science More »

HOME

Classifying the Complexity and Information of Cellular Automata


	Cellular automata (CA) can be classified according to the complexity and information produced by the behavior of the CA pattern: Class 1: Fixed; all cells converge to a constant black or white set Class 2: Periodic; repeats the same pattern, like a loop Class 3: Chaotic; pseudo-random Class 4: Complex local structures; exhibits behaviors of both class 2 and class 3; likely to support universal computation From the set of possible elementary CA rules, three rules were previously (manually) selected as examples for patterns of CA classes, with random initial condition.


	Contributed by: Daniel de Souza Carvalho
	Show Initialization Code

Inspired by:

CA classification by S. Wolfram and

parameter by C. Langton.

G. W. Flake, The Computational Beauty of Nature: Computer Explorations of Fractals, Chaos, Complex Systems, and Adaptation, Cambridge, MA: MIT Press, 1998.

Cellular Automata (Stephen Wolfram: Official Website)

Four Classes of Behavior (NKS|Online)

Elementary Cellular Automaton (Wolfram MathWorld)

"Classifying the Complexity and Information of Cellular Automata" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/ClassifyingTheComplexityAndInformationOfCellularAutomata/

Contributed by: Daniel de Souza Carvalho

Report an issue »

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

Browse all topics

	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 »

Wolfram Research

Site Index

RSS

Atom