10 search results - page 1 / 2 » On the Turing degrees of minimal index sets |
APAL
2007
13 years 5 months ago
2007
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-tabl...
CIE
2009
Springer
14 years 1 days ago
2009
Springer
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...
AML
2004
13 years 5 months ago
2004
We show that there exists a single minimal (Turing) degree b < 0 s.t. for all c.e. degrees 0 < a < 0 , 0 = a b. Since b is minimal this means that b complements all c.e....
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 ...
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...