Gödel’s first incompleteness theorem – an interactive tutorial
Cool page, though the Halting Problem brings with it a lot of stuff, so using it to prove Godel's first incompleteness theorem is (imo) a bit like cheating. I've proven it before using diagonalization on my blog (but also using concepts like computability for free). At the end of the day, using these ideas, you get the Curry–Howard correspondence for free (which, again, is a bit like cheating).> Gödel’s original proof was slightly strongerTechnically speaking, a lot stronger. Proving Godel's first incompleteness theorem (don't even get me started on the second) from first principles is actually much more involved; and certainly more difficult to make it intelligible for non-logicians.