Cellular Automaton
A mathematical computational model composed of a discrete grid, in which each cell has a finite set of states and updates synchronously according to a uniform local rule. Complex spatiotemporal patterns can emerge from simple rules.
Timeline (last 90 days)
A cellular automaton is composed of a discrete grid, in which each cell has only a finite number of states and updates synchronously according to uniform local rules, with the next state depending only on the current states of itself and its neighbors.
Cellular automata were proposed by mathematician John von Neumann and Stanislaw Ulam in the 1940s, with the most famous example being John Conway's Game of Life.
All Facts (2)
Cellular automata were proposed by mathematician John von Neumann and Stanislaw Ulam in the 1940s, with the most famous example being John Conway's Game of Life.
60%UnverifiedA cellular automaton is composed of a discrete grid, in which each cell has only a finite number of states and updates synchronously according to uniform local rules, with the next state depending only on the current states of itself and its neighbors.
50%