 A real number is called "computable" if there exists an algorithm that yields its digits.Because there are only countably many algorithms, but an uncountable number of reals, almost all real numbers fail to be computable.Moreover, the equality of two computable numbers is an undecidable problem.