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:
“But however the forms of family life have changed and the number expanded, the role of the family has remained constant and it continues to be the major institution through which children pass en route to adulthood.”
—Bernice Weissbourd (20th century)