The approximation structure of a computably approximable real
Journal of Symbolic Logic 68 (3):885-922 (2003)
| Abstract | A new approach for a uniform classification of the computably approximable real numbers is introduced. This is an important class of reals, consisting of the limits of computable sequences of rationals, and it coincides with the 0'-computable reals. Unlike some of the existing approaches, this applies uniformly to all reals in this class: to each computably approximable real x we assign a degree structure, the structure of all possible ways available to approximate x. So the main criterion for such classification is the variety of the effective ways we have to approximate a real number. We exhibit extreme cases of such approximation structures and prove a number of related results | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesRussell Miller (2005). The Computable Dimension of Trees of Infinite Height. Journal of Symbolic Logic 70 (1):111 - 141.
Peter Smith (1998). Approximate Truth and Dynamical Theories. British Journal for the Philosophy of Science 49 (2):253-277.
Leo Harrington & Robert I. Soare (1998). Codable Sets and Orbits of Computably Enumerable Sets. Journal of Symbolic Logic 63 (1):1-28.
Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon (2005). Computable Categoricity of Trees of Finite Height. Journal of Symbolic Logic 70 (1):151 - 215.
Denis R. Hirschfeldt, Bakhadyr Khoussainov & Richard A. Shore (2003). A Computably Categorical Structure Whose Expansion by a Constant has Infinite Computable Dimension. Journal of Symbolic Logic 68 (4):1199-1241.
Rodney G. Downey & Evan J. Griffiths (2004). Schnorr Randomness. Journal of Symbolic Logic 69 (2):533 - 554.
William C. Calhoun (2006). Degrees of Monotone Complexity. Journal of Symbolic Logic 71 (4):1327 - 1341.
Wesley Calvert, Julia F. Knight & Jessica Millar (2006). Computable Trees of Scott Rank $\Omega _{1}^{\Mathit{CK}}$ , and Computable Approximation. Journal of Symbolic Logic 71 (1):283 - 298.
Alexander Raichev (2005). Relative Randomness and Real Closed Fields. Journal of Symbolic Logic 70 (1):319 - 330.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads4 ( #178,800 of 549,196 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
