Computable Number
Jump to navigation
Jump to search
A Computable Number is a real number that can be computed to within any desired precision by a finite, terminating algorithm.
- See: Real Closed Field, Computable Function, Real Numbers, Algorithm, μ-Recursive Function, Turing Machines, Lambda Calculus.
References
2016
- (Wikipedia, 2016) ⇒ https://en.wikipedia.org/wiki/computable_number Retrieved:2016-6-2.
- 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 or recursive 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.
- 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 or recursive reals.