50 search results - page 1 / 10 » On the Turing Degrees of Divergence Bounded Computable Reals |
CIE
2005
Springer
13 years 11 months ago
2005
Springer
The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of ∆0 2-reals which have very interesting computability-theoretical as...
APAL
2011
13 years 11 days ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
APAL
2010
13 years 5 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
APAL
2006
13 years 5 months ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
JC
2000
13 years 5 months ago
2000
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 degr...