Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
If there is an NP-complete language L whose complement is in NP, then complement of any language in NP is in
1
P
2
NP
3
both (A) and (B)
4
none of these