> In 1900, Hilbert gave his famous address where he stated the Hilbert Problems. One of these was to prove that mathematics is "consistent" in the sense that ev

> In 1900, Hilbert gave his famous address where he stated the Hilbert Problems. One of these was to prove that mathematics is "consistent" in the sense that every possible statement is either provable or disprovable from the axioms. > In an effort to solve this problem, Alan Turing wrote his famous paper "On Computable Numbers" where he conceived for the first time his "Turing Machines". Whoa -- you completely skipped Gödel's Incompleteness Theorems. Gödel's Theorems answered Hilbert's inquiry, not Turing. It's true that the Turing halting problem and Gödel's Theorems are deeply connected, but the historical sequence is Hilbert, Gödel, then Turing. You can't leave Gödel out. http://en.wikipedia.org/wiki/G%C3%B6dels_incompleteness_theorems http://en.wikipedia.org/wiki/G%C3%B6dels_incompleteness_theo...