Definition
Cellular Automaton
Cellular Automata are a class of computational models whose outcomes merge from the local interactions of simple rules. A cellular automata consists of of a lattice of computing cells that iteratively update their states based exclusively on their own state and the states of their local neighbours.
On a classical CA, each cell’s state is represented by an integer and adjacent cells are considered neighbours. Critically, the update rule of a cellular automaton is identical for all cells.
They were introduced by John von Neumann to build a self-replicating machine or Universal Constructor].