1521-3870/asset/2256_left.gif?v=1&s=becebab9c3e85769a14b145f17b8e337848bc48b)
1521-3870/asset/2256_right.gif?v=1&s=6d251fa351b8e0943ed3dc42b2beb251d4cbfa3e)
Original Paper
Recursive Approximability of Real Numbers
Article first published online: 14 OCT 2002
DOI: 10.1002/1521-3870(200210)48:1+<131::AID-MALQ131>3.0.CO;2-#
© 2002 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
Issue
1521-3870/asset/cover.gif?v=1&s=3df32dbed8d9153ac6eafe1eaa786854b9b48345 "Mathematical Logic Quarterly")
Mathematical Logic Quarterly
Supplement: Mathematical Logic Quarterly/Supplement 1
Volume 48, Issue Supplement 1, pages 131–156, October 2002
Additional Information
How to Cite
Zheng, X. (2002), Recursive Approximability of Real Numbers. Mathematical Logic Quarterly, 48: 131–156. doi: 10.1002/1521-3870(200210)48:1+<131::AID-MALQ131>3.0.CO;2-#
Publication History
- Issue published online: 14 OCT 2002
- Article first published online: 14 OCT 2002
- Manuscript Revised: 17 MAY 2002
- Manuscript Received: 6 JAN 2002
- Abstract
- References
- Cited By
Keywords:
- Computable reals;
- R.e. reals;
- left and right computable reals;
- semi-computable reals;
- Weakly computable reals;
- random r.e. reals;
- divergence bounded computable reals;
- Recursively approximable reals
Abstract
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 ofr ational numbers.