On the Turing Degrees of Weakly Computable Real Numbers
Xiaoyang Zheng · Journal of Logic and Computation · 2003
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degree properties of semi‐computable and weakly computable real numbers introduced by Weihrauch and Zheng. We show that there are two real numbers of c.e. binary expansions such that their difference does not have an ω.c.e. Turing degree.