Cellular automaton
discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. Cellular automata have found application in various areas, including physics, theoretical biology, and microstructure modeling.
A cellular automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood is defined relative to the specified cell. An initial state (time t = 0) is selected by assigning a state for each cell. A new generation is created (advancing t by 1), according to some fixed rule (generally, a mathematical function) that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood.
Begin with the source’s own compact description: “Cellular automaton” is discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling. The dossier treats that line as a proposition to test through Cellular, automaton and discrete, not as a finished interpretation.
Why this record matters
The phrase “discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling” supplies a clear boundary for inquiry. It also exposes the unanswered questions: who defined that boundary, when it became stable and which sources sit outside it.
Datasets, specimens, observations and peer-reviewed methods provide the appropriate test for the technical claims summarized here. The source revision retrieved here is dated Sep 23, 2026. The linked authority identifier is Q189156. The Library of Congress control number is sh85021692. 1 of 1 selected statements include explicit references; 0 carry qualifiers and 0 use preferred rank.
Scientific names, classifications and consensus can change while older terminology persists in catalogues and historical literature. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Check terminology, classification and the date of the cited evidence. Scientific names and technical consensus can change while older records retain historical value.
- Current terminology
- Classification context
- Finding cited technical literature
Primary datasets, specimen catalogues, standards bodies and the most recent peer-reviewed literature.
Three-step research path
- Establish the record: confirm the title “Cellular automaton”, its source revision and the description used here.
- Expand the search: follow Cellular automaton primary sources, Cellular automaton archive and Cellular research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Cellular automaton”?
- Which observation, specimen, dataset or publication supports the account?
- Is the terminology current, historical or disputed?
Search terms from this dossier
This entry incorporates text from “Cellular automaton” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.