State at step N+1 for a cell is determined by the state of cells in the original cell's neighborhood (usually 'adjacent', sometimes 'orthogonally adjacent', according to some rule
game of life
One of the most famous cellular automata (and TC), although not the simplest TC cellular automaton
It is actually possible, working entirely within the constraints of card rules, using creatures as the tape, hacking card text w/ Artificial Evolution, to implement a Turing Machine using Magic cards.
