Sciweavers

Share
JC
2000

Weakly Computable Real Numbers

9 years 6 months ago
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.
Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2000
Where JC
Authors Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
Comments (0)
books