Recursively Undecidable Properties of NP
V.G. Naidenko
TL;DR
This paper proves that there is no algorithm to decide whether a nondeterministic polynomial-time Turing machine recognizes a language in P, highlighting fundamental limits in computational complexity.
Contribution
It establishes the undecidability of determining P-membership for languages recognized by NP machines, extending understanding of computational boundaries.
Findings
No algorithm can decide P-membership for NP-recognized languages.
Undecidability results apply to nondeterministic polynomial-time Turing machines.
Highlights fundamental limits in classifying NP languages.
Abstract
We show that there cannot be any algorithm that for a given nondeterministic polynomial-time Turing machine determinates whether or not the language recognized by this machine belongs to P
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · semigroups and automata theory · Computability, Logic, AI Algorithms