On 15 Jun., 12:26, stevendaryl3...@yahoo.com (Daryl McCullough) wrote:
> (B) There exists a real number r, > Forall computable reals r', > there exists a natural number n > such that r' and r disagree at the nth decimal place.
In what form does r exist, unless it is computable too?
But if r is computable, then this theorem shows that the computable numbers are uncountable. Contradiction.
And if r is not computable, then it is impossible to prove disagreement with any r'.
