The 1936 Machine
ForrestKnight treats Turing's paper as an origin story: a machine, a decision problem, and a vocabulary for computation. The written record sharpens that claim. The halting problem asks whether an arbitrary program and input will eventually halt. Turing's proof says no general algorithm can answer that for every case, which gives the documentary its clean, stubborn limit.






