cellular automata

Cellular Automata (Cellular Automaton, CA) is a discrete mathematical model, which is composed of "cells" on a regular grid, and each cell evolves according to the deterministic rules according to the local neighborhood state. John Conway's "Game of Life"(Conway's Game of Life) proposed in 1970 is the most famous two-dimensional CA. On an infinite grid, each cell has two states of "living" or "dead" and follows three minimalist rules: die alone (neighbor<2), crowded and dead (neighbors> 3), just breeding (neighbors = 3). Despite its simple rules, the game of life is Turing-complete, capable of simulating any computational process. It exhibits amazing emergent behavior-from static blocks and oscillators to self-replicating "gliders" and even the construction of logic gates and computers. Conway's life game profoundly reveals the emergence principle of "simple rules produce complex phenomena" and becomes the classic paradigm of complex system science, computability theory and artificial life research.