The Game of Life (GoL) is perhaps the simplest cellular automata. It’s “played” on a 2D grid. Each cell is alive or dead. At each step, we count each cell’s alive neighbors. If there are 2 or 3, the cell may stay alive. If exactly 3, the cell is “born” if it was dead. Otherwise, the cell stays dead or dies. These simple rules lead to a lot of rich behavior. Similarly complex behavior can be produced by even simpler cellular automata, such as rule 30 or 110 of the 1D rules.
2. Yardsticks of the Computable Universe
Moral Of Story
1

GoL can’t be the simplest automaton if there are even simpler ones.

Like what you read? Give hxka a round of applause.

From a quick cheer to a standing ovation, clap to show how much you enjoyed this story.