Wolfram Rule 30 Cellular Automaton

Any of the 256 elementary rules, live density and entropy graphs, damage spreading and exact self-checks.

The science

An elementary cellular automaton updates a row of cells that are 0 or 1. Each new cell depends only on itself and its two neighbours, so there are 2³ = 8 neighbourhoods and 2⁸ = 256 rules. The rule number is the binary word formed by the eight outputs: the output for neighbourhood with value n = 4l + 2c + r is bit n of the rule number.

Checks. (1) The lookup-table implementation of rule 30 is compared with the independent boolean formula over 500 generations; (2) rule 90's live-cell count is compared with the exact formula; (3) the rule-30 left edge is verified; (4) the 2000-bit centre column is compared with a fair coin (z-score).

Simplifications. The grid has finite width: with zero boundaries the pattern is exact until it reaches an edge, with wrap-around it is a ring. Statements about "randomness" are empirical tests of finite samples, not proofs; the 4-bit block entropy is a rough indicator only.