Tool
Conway's Game of Life
2D Turing-complete cellular automaton. Birth/Survival rule B3/S23. The simplest dynamical system known to be capable of universal computation; lives squarely at the edge of chaos.
Generation: 0
Conway's Game of Life
B3/S23 — alive cell survives with 2 or 3 neighbours, dies otherwise;
dead cell becomes alive with exactly 3 neighbours.
Despite its trivial local rule, Game of Life is Turing-complete:
gliders and glider guns implement universal computation. Wolfram class IV.FAQ