## Abstract In mathematics, various representations of real numbers have been investigated. All these representations are mathematically equivalent because they lead to the same real structure β Dedekindβcomplete ordered field. Even the effective versions of these representations are equivalent in
Recursive Approximability of Real Numbers
β Scribed by Xizhong Zheng
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 359 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limit real number might have more effectivity. In this note we summarize some recent attempts to classify the recursively approximable real numbers by the convergence rates of the corresponding computable sequences of rational numbers.
π SIMILAR VOLUMES
## Abstract In the first author's thesis [10], a sequential language, LRT, for real number computation is investigated. That thesis includes a proof that all polynomials are programmable, but that work comes short of giving a complete characterization of the expressive power of the language even fo