Do you understand Turing's proof that the halting problem is undecidable? Godel's proof of the incompleteness of mathematics is really the same thing. He just

Do you understand Turing's proof that the halting problem is undecidable? Godel's proof of the incompleteness of mathematics is really the same thing. He just did his proofs before computers were invented so a lot of his explanations are needlessly complicated by modern-talking-about-algorithms standards.