2 ms·
First of all, know that the Halting problem and incompleteness are very related, so you are on the right track :). Here the idea is that to type-check our proof
by Ericson2314 11y ago
First of all, know that the Halting problem and incompleteness are very related, so you are on the right track :). Here the idea is that to type-check our proofs, if the proof language is sufficiently expressive, we need to run a program which may not terminate. But if it does terminate, we know the proof is good.
From Gödel's perspective, the proof-checker is written in an inconsistent language, because infinite loops themselves prove anything! But us humans are only finite-time-patient, and we have Ctrl-C, so such technicalities are irrelevant :)