Re: There are infallible documents
Posted: Wed Feb 19, 2025 12:55 pm
https://scottaaronson.blog/?p=710godelian wrote: ↑Wed Feb 19, 2025 12:52 pm It is in classical logic. I agree, however, that there are constructivist concerns. I am still trying to figure out what to do with this concern. I am currently looking at how the constructivist version of the proof for Gödel's first incompleteness theorem was rephrased away from its original version in classical logic. It may contain a trick as to how to solve the problem.
I’ll tell you why: because, when I teach Gödel to computer scientists, I like to sidestep the nasty details of how you formalize the concept of “provability in F.” (From a modern computer-science perspective, Gödel numbering is a barf-inducingly ugly hack!)
Instead, I simply observe Gödel’s Theorem as a trivial corollary of what I see as its conceptually-prior (even though historically-later) cousin: Turing’s Theorem on the unsolvability of the halting problem.
For those of you who’ve never seen the connection between these two triumphs of human thought: suppose we had a sound and complete (and recursively-axiomatizable, yadda yadda yadda) formal system F, which was powerful enough to reason about Turing machines. Then I claim that, using such an F, we could easily solve the halting problem. For suppose we’re given a Turing machine M, and we want to know whether it halts on a blank tape. Then we’d simply have to enumerate all possible proofs in F, until we found either a proof that M halts, or a proof that M runs forever. Because F is complete, we’d eventually find one or the other, and because F is sound, the proof’s conclusion would be true. So we’d decide whether M halts. But since we already know (thanks to Mr. T) that the halting problem is undecidable, we conclude that F can’t have existed.
“Look ma, no Gödel numbers!”