Category:Cellular automata
![]() | Computing portal |
Here is a list of articles in the category Cellular automata of the Computing portal that unifies foundations of mathematics and computations using computers.
Subcategories
This category has the following 3 subcategories, out of 3 total.
C
Pages in category "Cellular automata"
The following 31 pages are in this category, out of 31 total.
- Cellular automaton (computing)
A
- Asynchronous cellular automaton (computing)
B
- Block cellular automaton (computing)
- Bootstrap percolation (computing)
C
- Calculating Space (physics)
- Cam-6 (computing)
- Continuous automaton (computing)
- Continuous spatial automaton (computing)
- Curtis–Hedlund–Lyndon theorem (computing)
E
- Elementary cellular automaton (computing)
F
- Firing squad synchronization problem (computing)
I
- Information fluctuation complexity (computing)
L
- Lattice gas automaton (computing)
- Life-like cellular automaton (computing)
M
- Majority problem (cellular automaton) (computing)
- The Mathematics of Chip-Firing (computing)
- Mobile automaton (computing)
- Moore neighborhood (computing)
- Movable cellular automaton (physics)
N
- Network automaton (computing)
- A New Kind of Science (computing)
Q
- Quantum cellular automaton (computing)
- Quantum dot cellular automaton (computing)
R
- Reversible cellular automaton (computing)
S
- Second-order cellular automaton (computing)
- Speed of light (cellular automaton) (computing)
- Stochastic cellular automaton (computing)
- Surjunctive group (computing)
U
- Ulam–Warburton automaton (computing)
V
- Von Neumann neighborhood (computing)
W
- Wolfram code (computing)