A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Degree-Theoretic Aspects of Computably Enumerable Reals
[chapter]
Models and Computability
A real is computable if its left cut, L ; is computable. If q i i is a computable sequence of rationals computably converging to ; then fq i g; the corresponding set, is always computable. A computably enumerable c.e. real is a real which is the limit of an increasing computable sequence of rationals, and has a left cut which is c.e. We study the Turing degrees of representations of c.e. reals, that is the degrees of increasing computable sequences converging to : For example, every
doi:10.1017/cbo9780511565670.003
fatcat:3amdwueza5d6vpytitwjgdsg5y