Computable Number

Computable Number

In mathematics, computable numbers are the real numbers that can be computed to within any desired precision by a finite, terminating algorithm. They are also known as the recursive numbers or the computable reals.

Equivalent definitions can be given using μ-recursive functions, Turing machines or λ-calculus as the formal representation of algorithms. The computable numbers form a real closed field and can be used in the place of real numbers for many, but not all, mathematical purposes.

Read more about Computable Number:  Informal Definition Using A Turing Machine As Example, Formal Definition, Properties, Digit Strings and The Cantor and Baire Spaces, Can Computable Numbers Be Used Instead of The Reals?, Implementation

Famous quotes containing the word number:

    To finish the moment, to find the journey’s end in every step of the road, to live the greatest number of good hours, is wisdom. It is not the part of men, but of fanatics, or of mathematicians, if you will, to say, that, the shortness of life considered, it is not worth caring whether for so short a duration we were sprawling in want, or sitting high. Since our office is with moments, let us husband them.
    Ralph Waldo Emerson (1803–1882)