Recent searches
Search options
Speaking of the #Entscheidungsproblem, I feel a bit of Schadenfreude for (one of) its author(s), David Hilbert, who was absolutely convinced that mathematics was complete and provable from its own axioms. Hilbert famously has the phrase “Wir müssen wissen—wir werden wissen!” (we must know—we will know!) engraved as his epitaph, as a defiant cry against the phrase “ignorabus et ignorabimus” (we do not know, and we will not know).
Alan #Turing (in addition to Gödel) put the last nail in Hilbert’s hopes by proving that it was impossible to decide the answer to certain classes of computation problems, and therefore mathematics must be incomplete.
Ignorabus et ignorabimus. Deal with it. https://mastodon.social/@mcnees/110594075888924099
MastodonRobert McNees (@mcnees@mastodon.social)Attached: 1 image
In 1936 Turing wrote "On Computable Numbers, with an Application to the Entscheidungsproblem," in which he addresses Hilbert's decidability problem, proves that the Halting Problem is unsolvable, and lays out the modern definition of computability.
Ref: https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/plms/s2-42.1.230