Rule 30

Rule 30 is an elementary one-dimensional binary cellular automaton introduced by Stephen Wolfram in 1983. From a single black cell on an infinite white background, it generates a triangular pattern of extraordinary complexity — a pattern that passes every standard statistical test for randomness despite being produced by a completely deterministic, local rule.

The rule is defined by a simple lookup table: for each three-cell neighborhood (left, center, right), the new state of the center cell is determined by the binary representation of the rule number 30. The resulting pattern exhibits three distinct regions: a regular left-hand boundary, a chaotic central region, and a right-hand boundary with intermittent regularity. The central region is the source of the rule's computational irreducibility: no algorithm is known that can predict the state of a cell at step n without computing all intermediate steps.

Rule 30 is used as the default pseudorandom number generator in Mathematica and the Wolfram Language. Its unpredictability is not cryptographic — the seed determines the pattern — but it is computationally profound: the pattern contains no compressible structure that would permit a shortcut.

The significance of Rule 30 lies in what it demonstrates about simplicity and complexity. A rule with only eight entries in its lookup table produces behavior that is, for all practical purposes, random. This undermines the assumption that complex behavior requires complex rules. It suggests instead that complexity is abundant in the space of simple programs, and that the apparent simplicity of natural laws may be compatible with the apparent complexity of natural phenomena.