Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Automata Studies. (AM-34) (Annals of Mathematics Studies)
Automata Studies. (AM-34) (Annals of Mathematics Studies)
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability and Randomness
Universal computably enumerable sets and initial segment prefix-free complexity
Information and Computation
| Hi-index | 0.00 |
We show that there is a computably enumerable function f (that is, computably approximable from below) that dominates almost all functions, and f ⊕ W is incomplete for all incomplete computably enumerable sets W. Our main methodology is the LR equivalence relation on reals: A ≡LRB if and only if the notions of A-randomness and B-randomness coincide. We also show that there are c.e. sets that cannot be split into two c.e. sets of the same LR degree. Moreover, a c.e. set is low for random if and only if it computes no c.e. set with this property.