Cellular Automata The most basic sort of digital life. I was immediately fascinated. Of course, Cellular Automata (CA’s) are really just models of computation. A grid of independently independent cells, each with a computed state, affected by the states of neighboring cells. The most famous example of this is probably Conway’s game of life. Here cells are born or die based on the number of alive neighbors. Four simple rules define the entire game. You set an initial state, and the world just follows the rules. Some elements will rapidly die off, while others can move about, or generate elements that can move, and interact with others. This game is actually turing complete, meaning that with just these 4 rules, you can simulate an entire Universal Turing Machine (computer)! ...