Cellular Automata Examples

Cellular automata update grids of cells using fixed, local rules. Each tick applies the rule across the grid so patterns emerge from the interactions of neighboring cells.

They range from simple chaos like Rule 30 to fully general computation. Rule 110 in particular was proved Turing complete: despite its tiny rule table it can emulate any algorithm, showing how small rules can create a universe of behavior.