Hi! I'm Niklas, an open-minded and curious computer science student at KIT in Germany.
Joined 4w ago.
Seen 21m ago.
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 Godel numbering). But this would imply A0 = A1, which is a contradiction, because the reals are isomorphic to the powerset of the natural numbers. So there are reals that are uncomputable...
Which are your favorite personal blogs?