MathDBNo complete UP set conjecture
No complete UP set conjecture
The class UP consists of languages accepted by polynomial-time nondeterministic Turing machines having a unique accepting computation on every accepted input. No complete UP set conjecture. There is no complete set, with respect to many-one reductions, in UP. The source presents this as a strengthening of the uniform no-p-optimal-proof-system conjecture.
Sources & referencesView supporting material
Primary source
Pavel Pudlak, “Incompleteness in the finite domain”, arXiv:1601.01487 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.