Cellular automaton
= Cellular automaton
{wiki}
A <cellular automaton> assigns one of finitely many states to each cell of a regular grid and updates cells in discrete generations using a fixed local rule. In the synchronous convention, each new state depends only on old states in a finite neighborhood. <Conway's Game of Life> supplies a concrete example with two states and eight neighbors; its global update is a <function> on complete configurations, with <deterministic evolution>.https://github.com/nathanieljohnston/game-of-life-book/blob/master/early_life.tex[Johnston and Greene, chapter 1: Life and cellular automata]{ref}
// Destination: foundations-of-mathematics.bigb