Which of the following problem is not NP complete but undecidable?
Which of the following problem is not NP complete but undecidable? Correct Answer Halting Problem
- The halting problem is NP-Hard, not NP-Complete, but is undecidable. Hence option 2 is correct.
- Hamiltonian circuit, bin packing, partition problems are NP-complete problems.
Important Points
- The halting problem is undecidable over Turing machines.
- The halting problem is recursively enumerable but not recursive. we can run the Turing Machine and accept if the machine halts, hence it is recursively enumerable.
মোঃ আরিফুল ইসলাম
Feb 20, 2025