A discrete spatially extended dynamical system defined on a regular lattice of sites (cells), each taking values from a finite set and updated in synchronous discrete time steps by a uniform local rule that maps a cell's neighborhood state to its next state.

Principle

Global complexity arises from repeated application of a simple, translation-invariant local update rule acting on each cell's neighborhood; the system's evolution is fully determined by local interactions and initial conditions.

Demonstration

Elementary rule 30 on a one-dimensional binary lattice produces aperiodic, pseudo-random patterns from simple initial seeds; Conway's Game of Life (a two-dimensional binary automaton) generates mobile and self-replicating structures from the same formal mechanism.

Misapplication

Treating the model as a surrogate for continuous spatiotemporal dynamics without justifying a discrete approximation, or assuming that deterministic local rules guarantee long-term predictability and smooth macroscopic behavior.

Consequence

When used appropriately, cellular automata yield emergent structures, compact representations of spatial computation, and minimal models for universality classes of discrete dynamics; they can encode computation and complex pattern formation from local rules.

Reversal

A design in which global constraints or target macrostates are imposed and local update rules are derived to achieve them (inverse design), rather than letting uniform local rules generate global patterns.

Boundary

Applies to discrete-time, discrete-space systems with a finite set of local states and uniform local rules; excludes continuous PDEs, continuous-state lattice models, and heterogeneous agent-based systems unless explicitly recast into the cellular-automaton formalism.

Semantic Tension

Differs from lattice statistical-mechanics models (which emphasize equilibrium distributions and probabilistic measures) and from generic agent-based models (which allow heterogeneous rules and asynchrony): cellular automata emphasize synchronous, uniform, local deterministic or rule-based updates.

Synthesis

A cellular automaton is a synchronous, lattice-indexed discrete dynamical system whose global trajectories and emergent behavior result from iterating a single, local update rule across identical cells with finite state sets.