Definition
Plain language
A grid of cells that update step by step according to a fixed rule, often used as a simple model of computation.
As stated in the literature
A discrete dynamical system in which cells transition synchronously based on local neighborhood rules; used as a controlled testbed for studying whether models can simulate sequential computation.
Also called: cellular automata
Why it matters: It gives researchers a clean, fully understood test case for asking whether a neural network can learn to faithfully simulate step-by-step computation.
For example, Conway's Game of Life turns a simple grid rule about live and dead neighbors into surprisingly complex evolving patterns.
Heard on the show
“But the headline setup is the cellular automaton experiment.”Episode 085 — Why Long-Context Models Might Need Compute, Not Capacity, Before Eviction