3 search results - page 1 / 1 » On the jump classes of noncuppable enumeration degrees |
JSYML
2011
13 years 8 days ago
2011
We prove that for every Σ0 2 enumeration degree b there exists a noncuppable Σ0 2 degree a > 0e such that b ≤e a and a ≤e b . This allows us to deduce, from results on the...
AML
2010
13 years 5 months ago
2010
We investigate and extend the notion of a good approximation with respect to the enumeration (De) and singleton (Ds) degrees. We refine two results by Griffith, on the inversion of...
APAL
2010
13 years 5 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...