ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A Diophantine prefix is generically decidable when an algorithm decides the corresponding positive-integer Diophantine sentences on the restricted collection of inputs specified by the source's genericity condition. Consider the prefixes ∃∀∃\exists\forall\exists and ∃∃∀∃\exists\exists\forall\exists. Singly exponential generic-decidability conjecture. Both prefixes are generically decidable within singly exponential time. The source presents this as a further conjecture beyond its established generic decidability result; no resolution is given.

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.