Dobrinen–Simpson conjecture on high degrees and almost everywhere domination
Statement
Let be a set of natural numbers, let denote its Turing jump, and let denote the second Turing jump of the computable degree. A set is almost everywhere dominating when it has the almost-everywhere domination property discussed in the paper. Dobrinen–Simpson conjecture.
This conjecture asks whether highness is equivalent to almost everywhere domination. The surrounding text states that the reverse implication and the question of whether every high degree is almost everywhere dominating were not settled there; its resolution is therefore not established by the supplied source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.