Earlier quoted context omitted.
> What do "real" numbers buy you? They're well-known and have a simpler implementation, and we are familiar with their quirks. There is a giant body of useful knowledge built up around standard real analysis. That doesn't really exist if you insist on using only computable numbers. The computables are also more fiddly in many ways. Because equality is undecidable, you can't have discontinuous functions, you need to c…
> equality is undecidable equality is always undecidable until you see the light of intuition. consider the rational number whose numerator is 0 if $theorem is true, and 1 if it is false, and whose denominator is 1.
We define computable numbers to be Turing machines, lambda reduction processes, or whatever your favorite model of computation happens to be. If you don't like this kind of definition, then we need to talk philosophy of computation.
To decide equality, we let your machines clunk along until they both produce a result, which we then compare (using another machine). Hello Mr. Halting Problem. Specific programs are fine, but comparing against arbitrary classes of program is the bugger. This is why discontinuous functions cannot exist in a hardline computable analysis theory.