What is a cellular automaton?

A cellular automaton (CA) is a grid of cells, each in a finite number of states (e.g. on/off). Every generation all cells update simultaneously according to a fixed local rule that depends only on a cell's own state and the states of its neighbours. Despite this simplicity, CAs can produce strikingly complex, lifelike patterns � an example of emergence.

What are Wolfram's elementary 1D rules?

Elementary cellular automata are 1-dimensional: each row is computed from the row above using a rule that takes three consecutive cells as input (2� = 8 possible patterns). The output for each pattern is encoded in an 8-bit number 0�255 � the 'rule number'. Rule 110 is especially famous because it is Turing-complete: any computation can be performed by a sufficiently large Rule 110 automaton.

How does Conway's Game of Life work?

The Game of Life uses a 2D grid with two states: alive and dead. Each generation: a live cell survives if it has 2 or 3 alive neighbours; a dead cell is born if it has exactly 3 alive neighbours; otherwise it dies or stays dead. These four rules produce an enormous variety of stable structures, oscillators, gliders, and even universal Turing machines.

What is Langton's Ant?

Langton's Ant is an ant that moves on a 2D grid: on a white (off) cell it turns right 90�, flips the cell to black, and moves forward; on a black (on) cell it turns left 90�, flips the cell to white, and moves forward. After approximately 10,000 steps the ant begins building an infinitely repeating 'highway' � a remarkable example of deterministic chaos.

Comp Sci GCSE • A-Level • AP • University ●●○ Intermediate ★ Free

Cellular Automata Explorer

Six classic automata in one interactive playground � from Wolfram's 1D rule space to Conway's Life, Brian's Brain, and Langton's self-organizing Ant.

Generation

Mode

Conway's Life

Live Cells

Density

Mode

Wolfram Rule: 110

Cell Size: 6px

Speed: x2

What Are Cellular Automata?

A cellular automaton (CA) is a discrete model of computation consisting of a grid of cells, each in one of a finite set of states. At each generation every cell simultaneously transitions to a new state based on a fixed local rule � typically depending only on the cell and its immediate neighbours. Despite this simplicity, CAs produce breathtaking complexity.

🔢 Wolfram 1D Rules

Stephen Wolfram systematically explored all 256 elementary CA rules in the 1980s. Each rule is encoded as an 8-bit integer describing the next state for each of the 8 possible 3-cell neighbourhoods:

Pattern:  111  110  101  100  011  010  001  000
Rule 110:   0    1    1    0    1    1    1    0
               ? binary 01101110 = 11010

Wolfram classified rules into four classes: uniform, periodic/striped, chaotic/random, and complex. Rule 110 � in class IV � is the only elementary rule proven to be Turing-complete.

? Conway's Game of Life

John Conway's 1970 Life ruleset (B3/S23) uses a 2D Moore neighbourhood:

Birth: A dead cell with exactly 3 live neighbours becomes alive
Survival: A live cell with 2 or 3 live neighbours survives
Death: All other live cells die (underpopulation or overcrowding)

The emergent menagerie includes still lifes, oscillators, gliders, spaceships, guns, and even self-replicating patterns. Life is also Turing-complete.

🐜 Langton's Ant

Christopher Langton's 1986 ant follows two rules on a binary grid:

On a white cell: turn right 90�, flip cell to black, move forward
On a black cell: turn left 90�, flip cell to white, move forward

After ~10,000 highly irregular steps, the ant spontaneously enters a regular mode and builds a diagonal "highway" that repeats every 104 steps � indefinitely. This abrupt transition from chaos to order is one of the most striking demonstrations of self-organisation.

🧠 Brian's Brain

Brian Silverman's three-state rule (off / alive / dying) creates a perpetual motion machine: a cell is born if it has exactly 2 live neighbours; a live cell always becomes "dying"; a dying cell always becomes dead. The result is a sea of fast-moving gliders remarkably reminiscent of a neural firing pattern � hence the name.

Seeds (B2/S�) births on 2 neighbours but nothing survives � producing explosive growth fronts. Highlife (B36/S23) is a superset of Life that supports a self-replicating pattern called the replicator.

Wolfram's Four Classes

Wolfram's 2002 book A New Kind of Science proposed that all cellular automata � and indeed large swaths of physics � can be classified by the behaviour they produce:

Class	Behaviour	Example Rules	Analogy
I	Converges to uniform state	0, 255, 32	Fixed point attractors
II	Simple periodic / nested patterns	4, 108, 90	Limit cycles
III	Appears random, chaotic	30, 45, 86	Strange attractors
IV	Complex, localised structures	110, Life	Edge of chaos, computation

Emergence and Computation

CAs demonstrate one of the most profound ideas in science: that simple, local rules with no global coordination can produce arbitrarily complex global behaviour. The implications span physics (lattice-gas fluid dynamics, quantum cellular automata), biology (morphogenesis, neural models), chemistry (reaction-diffusion systems), and computer science (parallel computation, cryptographic pseudorandom generators based on Rule 30).

The question of which CAs are capable of universal computation � the computational universality problem � remains an active area of research. Proven universal CAs include Rule 110, Conway's Life, and several variants. The hunt for the simplest universal CA continues.

Related Simulations

Game of Life Evolution Simulator Flocking Boids Reaction-Diffusion Fractal Explorer Lorenz Attractor Ising Model

📖 Recommended Reading

Cellular Automata: From Simple Rules to Complex Worlds Conway's Game of Life: Patterns & Complexity Emergence & Self-Organisation: Simple Agents, Complex Systems Chaos Theory & the Double Pendulum The Ising Model: Phase Transitions and Emergent Magnetism

🔒 Premium Feature

Unlock HD PNG/GIF export, custom rule editor, save/load configurations, and all 32 simulations with MySimulator Premium.

Curriculum Relevance

Level	Topic	Relevance
GCSE / KS4	Algorithms & logic	State machines, simple rules producing complex behaviour
A-Level / IB	Computing, Decision Maths	Boolean logic, rule-based computation, emergent structures
Undergraduate CS	Theory of computation	Turing-completeness (Rule 110 / Life), formal languages
Postgraduate	Complexity science, mathematical biology	Self-organisation, pattern formation, artificial life