Weakly Computable Real Numbers

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 [19]. Among others 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.

• Type: Journal
• Year: 2000
• Where: JC
• Authors: Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
• Keywords: Binary Expansions, JC 2000, Real Numbers, Turing Degree