Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
779 views
in General by (72.6k points)
closed by
Which of the following problem is not NP complete but undecidable?
1. Partition Problem
2. Halting Problem
3. Hamiltonian Circuit
4. Bin Packing

1 Answer

0 votes
by (121k points)
selected by
 
Best answer
Correct Answer - Option 2 : 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.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...