A cellular automaton is a discrete model of computation studied in automata theory.
It consists of a regular grid of cells, each in one of a finite number of states; a new generation is created according to some fixed rule that determines the new state of each cell in terms of the current state of the cell and its neighborhood.
Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known, such as the stochastic cellular automaton and asynchronous cellular automaton.
A well-known cellular automaton is Conway’s Game of Life.
Simulating complete lives of different cellular animals and plants. Evolution, inheritance, predation and more.
Simulation of Nagel and Schreckenberg's cellular automaton model for freeway traffic simulation
Project for Object Oriented Programming (Java) classes at my university. Application allowing to simulate and visualize various types of cellular automatons including classical Conway's Game of Life, Quadlife, Langton's Ant, Wireworld and Elementary Automaton (one-dimensional).
Created by Stanisław Ulam, John von Neumann
Released 1940