Singly exponential generic decidability conjecture for Diophantine prefixes
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 and . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.