#OTD in 1936.
Alan Turing submits On Computable Numbers for publication.
His proof shows that there can be no mechanical, general method (i.e., a Turing machine or a program in some equivalent model of computation) to determine whether algorithms halt. However, each individual instance of the halting problem has a definitive answer, which may or may not be practically computable.
Edited 114d ago