Cellular automaton

Overview
Cellular automaton is a study in the simulation of cellular life using mathematical models. A full understanding of cellular automata have a wide range implications for a large variety of scientific and social fields.

[[File:1603390142_e641501dfa_o.gif|frame|A 3D representation of a cellular automaton model

(source: Object e Research)]]

Wolfram's Classification
In his book, A New Kind of Science, Stephen Wolfram examines the many computational models of cellular automata and creates a classification of the different complexity classes these models could exhibit.
 * "Class 1: Nearly all initial patterns evolve quickly into a stable, homogeneous state. Any randomness in the initial pattern disappears.


 * Class 2: Nearly all initial patterns evolve quickly into stable or oscillating structures. Some of the randomness in the initial pattern may filter out, but some remains. Local changes to the initial pattern tend to remain local.


 * Class 3: Nearly all initial patterns evolve in a pseudo-random or chaotic manner. Any stable structures that appear are quickly destroyed by the surrounding noise. Local changes to the initial pattern tend to spread indefinitely.


 * Class 4: Nearly all initial patterns evolve into structures that interact in complex and interesting ways. Class 2 type stable or oscillating structures may be the eventual outcome, but the number of steps required to reach this state may be very large, even when the initial pattern is relatively simple. Local changes to the initial pattern may spread indefinitely. Wolfram has conjectured that many, if not all class 4 cellular automata are capable of universal computation. This has been proven for Rule 110 and Conway's Game of Life."