Cellular Automata
Updated 2026-09-10
INTRODUCTION
English translation pending.
CORE DEFINITION
Cellular automata are discrete, abstract computational systems that serve both as general models of complexity and as concrete representations of nonlinear dynamics in various sciences. They are discrete in space and time: they consist of a finite or countable number of homogeneous, simple units called cells, and at each moment every cell is in one of a finite number of states. Wolfram's four-class scheme is widely used to describe their behavior.
SCAFFOLDING EFFECT
Reduce cognitive load
- Model with local rules: simulate a system bottom-up using local rules together with parallel updating. - Explain emergence: show how global complexity arises from local coupling among many simple units. - Classify behavior: sort long-run outcomes into fixed, periodic, chaotic, and genuinely complex classes.
Anchor fast decisions
The key is simple rules plus local interaction plus parallel updating: each cell's next state depends only on its own state and its neighbors' states, and all cells update simultaneously. This setup generates four broad behavior classes, showing that global complexity need not come from complex individuals, since it can emerge from many homogeneous simple units coupled locally.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- plato.stanford.eduhttps://plato.stanford.edu/entries/cellular-automata/verified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS