Computability

In 1936, Alan Turing imagined a machine that reads and writes symbols on a tape, and showed it can carry out any computation at all. Program Turing machines yourself, meet the universal machine behind every computer, and follow Turing's proof that some problems, like predicting whether a program will ever stop, are impossible to solve. Then design a finite automaton, and play a domino puzzle that no algorithm can solve in general.