395 search results - page 5 / 79 » Degrees of Weakly Computable Reals |
FCT
2007
Springer
14 years 2 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
We show that every real low for Demuth randomness is of hyperimmune-free degree.
SPAA
2009
ACM
14 years 3 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
CIE
2007
Springer
14 years 2 months 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 ...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
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 ...