| 1940s–1960s |
Von Neumann Self-Replicating Automaton |
Proposed by John von Neumann and Ulam, it modeled self-reproduction in formal logic. This became the foundation of artificial life, showing how information and structure can replicate through rule-based construction. Later simplified by Codd. |
| 1960s |
L-system (Lindenmayer System) |
A grammatical model expressing plant growth as recursive symbol rewriting. It generates branching and leaf structures via simple rules, forming the basis of fractal geometry and procedural modeling—an early form of morphological automaton. |
| 1970s |
Conway’s Game of Life |
A grid-based system where simple birth/survival/death rules yield complex emergent patterns. Demonstrated how simple local rules create global order and even universal computation. It popularized “cellular automata” worldwide. |
| 1980s |
Wolfram’s 1D CA / Langton’s Loop |
Wolfram classified CA behaviors (Rules 30 & 110) and explored order-chaos boundaries. Langton’s self-replicating loop showed lifelike growth from minimal rules. Reversible CA and lattice-gas models extended automata to physical simulation. |
| 1990s |
Excitable, Reversible & Physical CA |
Systems like Brian’s Brain, Cyclic CA, and Greenberg–Hastings reproduced excitation and wave propagation. Toffoli–Margolus reversible CA and lattice-Boltzmann methods modeled fluids and heat, influencing physics and materials science. |
| 2010s–present |
SmoothLife / Lenia / Neural CA |
SmoothLife and Lenia introduced continuous-space life-like forms. Neural CA learned their own rules via neural networks, enabling self-repair and morphogenesis. These merge learning and automata, creating evolving rule-based systems. |
