Dense hard-sequence conjecture for true unprovable coTHEOREMS
Statement
Let be the set comprising and other dense sets of true sentences unprovable in , including the specified sets associated with universal Turing machines and Turing jumps. For a nondeterministic Turing machine accepting , let denote the th arithmetic sentence in the relevant enumeration. Dense hard-sequence conjecture. There is a dense subset of such that if and only if is a hard sequence for . The conjecture identifies dense hard sequences arising from true unprovable sentences and would imply that has dense hard sequences; the source notes that 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.