ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be a set of natural numbers, let A′A' denote its Turing jump, and let 0”0” 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.

A′≥T0”⇔A is a.e. dominating.A' \geq_T 0” \Leftrightarrow A\text{ is a.e.~dominating}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.