Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Which of the following problem is not NP complete but undecidable?
1
Partition Problem
2
Halting Problem
3
Hamiltonian Circuit
4
Bin Packing