Cellular Automata

Cellular automata are discrete models in which local rules update cell states repeatedly, sometimes generating complex global patterns.

A cellular automaton represents a collection of cells with discrete states. At each step, a rule updates a cell using a specified neighborhood; standard versions apply the same rule across a regular grid with simultaneous updates. Repeating a simple rule can produce stable patterns, oscillation, or complex-looking activity, depending on the rule and initial condition.

This demonstrates that a global pattern can arise without a coordinator specifying it in detail. It does not establish which rule produced a real social or biological pattern, or that all complex systems have simple causes. Boundary conditions, update timing, and state definitions can matter. Compare a model’s predictions with observations and alternatives before promoting a visual resemblance into an explanation.

When to use it

When exploring how local interactions could generate a larger pattern, or using explicit rules as a creative or teaching medium.

How it can help

Specify and inspect the rules, vary initial or boundary conditions, and use the results to test a precise question.