ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H′H' be the set comprising HH and other dense sets of true sentences unprovable in T\mathcal{T}, including the specified sets associated with universal Turing machines and Turing jumps. For a nondeterministic Turing machine MM accepting coTHEOREMS\texttt{coTHEOREMS}, let ϕi\phi_i denote the iith arithmetic sentence in the relevant enumeration. Dense hard-sequence conjecture. There is a dense subset HM′H'_M of H′H' such that i∈HM′i\in H'_M if and only if (⟨ϕi,1t⟩)t∈N(\langle\phi_i,1^t\rangle)_{t\in\mathbb{N}} is a hard sequence for MM. The conjecture identifies dense hard sequences arising from true unprovable sentences and would imply that coTHEOREMS\texttt{coTHEOREMS} has dense hard sequences; the source notes that H′H' and the associated notion of balance may not be fully well defined.

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.