Deterministic Chaos and Cellular Automata

February 14, 2014 at 12:15 PM
Forum for Mathematical Pearls (and Rarities), NTNU, Trondheim

A cellular automaton usually consists of cells in a grid, where each cell can be in one of many final states. A set of rules dicatates how the state of each cell depends on the cells around it. Such cellular automata was originally studied by Stanislaw Ulam and John von Neumann in the 40s and 50s, but later developed into a rich theory. We look at Stephen Wolfram's 1-dimensional cellular automata, John Conway's 2-dimensional cellular automata (Game of Life) and Christopher Langton's varieties of "artificial life" (Langton's Ant).