CA have discrete chunks of time called rounds. Each round produces the next “generation” of cells.
- http://mathworld.wolfram.com/ElementaryCellularAutomaton.html
- https://github.com/westonkd/Completeness/tree/CA
\begin{itemize} \item<1->2 states - dead or alive \item<2->3x3 Moore neighborhood \end{itemize}
\begin{enumerate} \item<3->Any live cell with fewer than two live neighbors dies (under population). \item<4->Any cell with 2 or 3 live neighbors lives on to the next generation. \item<5->A cell with more than 3 live neighbors dies (over crowding). \item<6->A dead cell with exactly 3 live neighbors becomes alive (reproduction). \end{enumerate}
\begin{center} \includegraphics[width=2cm]{images/beehive.png} \includegraphics[width=2cm]{images/toad.png} \includegraphics[width=2cm]{images/glider.png} \end{center}
https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life
The question - “Given a starting pattern and an ending pattern, will the starting pattern ever reach the ending pattern?”
- Conway’s Game of Life is Turing Complete
- http://rendell-attic.org/gol/tm.htm
- https://www.youtube.com/watch?v=My8AsV7bA94