Concept

Determinism

The property of a rule whose next state is a function of the present one, with nothing left to chance. It is compatible with unpredictability: a fully determined rule can separate nearby starts fast enough that no measurement pins down the future.

Named by 5 essays across one field — each of them below, with the objects they name alongside it.

Two orbits of the logistic map at 3.9, started 0.0001 apart. Two sequences from almost the same starting point, plotted together against the step number.

A difference too small to draw

Two starting points a ten-thousandth apart, under the same rule, with nothing random anywhere. Within forty steps they have nothing in common — and the rule was not doing anything to them that it does not do to everything.

dynamics · Sensitive dependence
Elementary cellular automaton, rule 90. A row of cells evolving downward, each cell decided by the three above it.

Eight rules and a triangle

A row of cells, each one deciding its next state from the three above it. Eight cases, one bit of output each — a rule that fits in a byte, and 256 of them in total. One of those bytes draws Pascal's triangle.

dynamics · Cellular automata
One disc, and two paths that stop being near each other. Two nearly identical billiard paths drawn on an empty square and on a square with a circular obstacle, with the separation between them plotted against distance travelled.

The obstacle that makes a table chaotic

Put one round post in the middle of a square table and every trace of order goes. Two paths that start a hundred-thousandth of a degree apart end up on opposite sides of the table, and the reason is that a wall curving outwards multiplies a gap where a flat one only adds to it.

dynamics · Billiards
Rule 184 at density 0.30. A space-time diagram of rule 184 on a ring of 120 cells, 80 steps down the page, starting from a random row with 36 cars. The diagonal stripes are free-moving cars; the jams dissolve.

A road where nobody overtakes

Rule 184 moves every 1 one cell to the right whenever the cell ahead is empty. It is one of only five elementary rules that never change the number of 1s, and that single property turns it into a model of traffic with an exact transition: below half density every jam dissolves, above it jams can never all clear and drift backwards against the flow.

dynamics · Cellular automata
A local rule taking a vote. A space-time diagram of the GKL rule on 149 cells from a random row with 69 ones. Black and white regions grow and meet along slanting boundaries, and after 69 steps the whole ring is 0.

No local rule can count the votes

A ring of cells, each holding 0 or 1, has to agree on whichever value is in the majority — every cell seeing only its neighbours. The best-known rule gets it right most of the time and wrong near a tie; no rule of any radius gets it right always. Yet two rules run one after the other do, on every ring, and the first of them is the traffic rule.

dynamics · Cellular automata

Named alongside it

The objects these essays reach for when they reach for this one.

Cellular automatonIterationLocalityChaosInvariantSensitive dependenceState spaceBilliardsBinaryComputationCounterexampleCurvature

All concepts