50 search results - page 2 / 10 » On the Turing Degrees of Divergence Bounded Computable Reals |
131
click to vote
CIE
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of a thin Π1 1 maximal antichains in ...
186
click to vote
JSYML
2008
15 years 6 months ago
2008
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
161
click to vote
ECCC
2000
15 years 5 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
138
click to vote
CIE
2009
Springer
16 years 18 days ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
144
click to vote
NDJFL
2010
15 years 24 days ago
2010
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class o...