ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T\mathcal{T} be the theory used to define H′H', and let H′H' be the collection of dense sets of true T\mathcal{T}-unprovable sentences described in the source. Given a nondeterministic Turing machine MM accepting coTHEOREMS\texttt{coTHEOREMS}, consider inputs ⟨ϕi,1t⟩\langle\phi_i,1^t\rangle with ii in a dense subset HM′H'_M of H′H'. Extremal dense hard-sequence conjecture. There exists such a dense subset HM′H'_M, and for every sufficiently large ∣x∣|x| depending on MM and T\mathcal{T}, MM requires 2t2^t steps for all tt on every input ⟨ϕi,1t⟩\langle\phi_i,1^t\rangle with i∈HM′i\in H'_M. This is presented as a stronger form of the preceding conjecture, asserting an exponential lower bound at every parameter tt and strengthening the proposed explanation for the absence of optimal proof systems.

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.