Recursive Approximability of Real Numbers

Mathematical Logic Quarterly 48 (S1):131-156 (2002)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,019

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Arithmetical Hierarchy of Real Numbers.Xizhong Zheng & Klaus Weihrauch - 2001 - Mathematical Logic Quarterly 47 (1):51-66.
WHAT IS. . . a Halting Probability?Cristian S. Calude - 2010 - Notices of the AMS 57:236-237.
Relative Randomness and Real Closed Fields.Alexander Raichev - 2005 - Journal of Symbolic Logic 70 (1):319 - 330.
Weak computability and representation of reals.Xizhong Zheng & Robert Rettinger - 2004 - Mathematical Logic Quarterly 50 (4-5):431-442.
Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.

Analytics

Added to PP
2013-12-01

Downloads
35 (#633,849)

6 months
8 (#544,556)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Specker sequences revisited.Jakob G. Simonsen - 2005 - Mathematical Logic Quarterly 51 (5):532-540.
H‐monotonically computable real numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.
Approximation Representations for Δ2 Reals.George Barmpalias - 2004 - Archive for Mathematical Logic 43 (8):947-964.

Add more citations

References found in this work

No references found.

Add more references