Cellular Automaton

Explore CellularAutomaton on MathWorld

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on the states of neighboring cells.

Cellular automaton is a college-level concept that would be first encountered in a theory of computation course.


Algorithm: An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point.
Recurrence Relation: A recurrence relation is a mathematical relationship expressing the members of a sequence as some combination of their predecessors.

Classroom Articles on Theory of Computation (Up to College Level)

  • Theory of Computation
  • Turing Machine