About Cellular Automata
Cellular automata demonstrate how simple local constraints create complex emergent behavior — the core thesis of Constraint Theory.
Each cell follows deterministic rules based only on its immediate neighbors, yet the system exhibits computation, self-organization, and even universal computation.
Key Concepts:
- Local Perception: Each cell only sees its neighbors (FPS paradigm)
- Constraint Satisfaction: State = solution to local constraints
- Emergence: Global patterns from local rules
- Universality: Some rules can simulate any computation
Current Rule:
Conway's Game of Life (B3/S23): A cell is born with exactly 3 neighbors and survives with 2 or 3 neighbors. This simple rule creates gliders, guns, oscillators, and universal computation.