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:
“You are the majority—in number and intelligence; therefore you are the force—which is justice. Some are scholars, others are owners; a glorious day will come when the scholars will be owners and the owners scholars. Then your power will be complete, and no man will protest against it.”
—Charles Baudelaire (1821–1867)