Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T18:18:26.281Z Has data issue: false hasContentIssue false

The approximation structure of a computably approximable real

Published online by Cambridge University Press:  12 March 2014

George Barmpalias*
Affiliation:
School of Mathematics, University of Leeds, Leeds LS2 9JT, U.K., E-mail: georgeb@maths.leeds.ac.uk

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable