So last night I wondered if all real numbers were computable.
Because if that was the case, then every real number could be matched to a turing machine (the one that computes it), which in turn could be matched to a natural number (its Gödel numbering). But this would imply א₀ = א₁, which is a contradiction, because the reals are isomorphic to the powerset of the natural numbers. So there are reals that are uncomputable.
Is this the case because computations have to be deterministic and finite? But you can calculate π? Or are approximations invalid? Because calculating π exactly is not finite, is it?
Okay, so I took a look and I’m really not surprised that they just brought up the Halting Problem again.
If you want to give me some feedback or share your opinion, please contact me via email.
© Niklas Bühler, 2020 RSS / Contact me