Harrington's conjecture on representatives of c.e. set orbits
Let be a computably enumerable set and let be a Turing degree. Write for the Turing jump of , and let denote the lattice structure associated with modulo finite sets. Harrington's conjecture. If
then there is a computably enumerable set such that
This asks whether the jump inequality is sufficient to find, within the degree , a representative whose orbit-invariant lattice structure agrees with that of . The source presents it as a conjecture of Harrington; no resolution is supplied here.
References
Primary source
Peter A. Cholak, Rod Downey and Leo Harrington, “The Complexity of Orbits of Computably Enumerable Sets”, arXiv:0705.0125 (2007).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.