Totalistic cellular automaton

A totalistic cellular automaton is a cellular automaton in which the update rule depends only on the sum (or some symmetric aggregate) of the states in a cell's neighborhood, rather than on the specific spatial arrangement of those states. This symmetry constraint reduces the rule space dramatically while preserving rich dynamical behavior.

The canonical example is Conway's Game of Life, a two-dimensional outer-totalistic automaton: the next state depends on the sum of the eight neighbor states, but with different thresholds for survival (a live cell persists with 2 or 3 neighbors) and birth (a dead cell becomes alive with exactly 3 neighbors). The outer-totalistic variant treats the cell's own state separately from the neighbor sum, adding just enough asymmetry to support gliders, guns, and universal computation.

Totalistic rules are computationally tractable in ways that general rules are not: their symmetry permits analytical approaches from statistical mechanics and mean-field theory. Yet they still generate the full Wolfram classification of behavior, from uniform fixed points to complex Class 4 structures. The totalistic constraint demonstrates that spatial specificity is not the source of complexity in cellular automata — the source is the threshold dynamics, the feedback between local state and neighborhood density, which totalistic rules preserve in their purest form.