Oh wow! This is a great write up on Godel's work. Anybody who even vaguely cares about fundamentals of computer science should definitely give it a read, and if possible a thorough read. Slightly related: Although a more technical/deeper discussion, but the book "Godel's Proof"[1] by Nagel and Newman is a very approachable text in this domain, and explains many aspects of the incompleteness theorems. [1] http://www.a…
Also I disagree with the completely unfounded assumptions at the end that the (terribly named) Reals have something to do with reality. The Reals are a Mathematical curiosity at best, but more often than not they complicate the understanding of subjects to which they have no relevance, eg. fractions (especially their decimal notation), calculus, physics, computing (especially floating point) and so on.
It's fine to treat infinite constructs like the Reals declaratively, eg. as functions which can be composed, but it's meaningless to reason about doing things to their 'final results', since there are no such things by definition. In more precise terms, it makes sense to reason about the output of co-terminating functions (which loop forever, spitting out, for example, a never-ending sequence of digits) but not diverging functions (which loop forever without ever getting as far as their first digit).