Cellular automata
Cellular automata are identical communicating finite-state machines,
arranged in arrays.
The simplest arrangement (enough to achieve Turing-equivalent
power) is a straight row of automata.
At each time click, each automaton changes state.
The new state is a function of the current states of the
automaton and its two neighbors.
Example
Number 30 in Wolfram's list of all 256 2-state automata with nearest-neighbor access.
Initial state in top row. Time progresses downwards.
©Wolfram Associates
prev next