Cellular Automata

• Imagine a grid (square, hexagonal or otherwise).
• Some of the elements are on, and some are off.
• Depending on the neighborhood of each cell, the state at the next step is determined.
• For example, on a square grid, if two of my neigbors are on at t, I will be on at t+1.
• The game of life is one such Cellular Automata. Apparently, it's Turing Complete.
• These are fun and interesting, but I haven't noticed much application for them.
• That said, they make an interesting game.