Consider two languages L1 and L2 each on the alphabet ∑. Let f : ∑ → ∑ be a polynomial time computable bijection such that (∀ x) [x ∈ L1 iff f(x) ∈ L2].

Further, let f^-1 be also polynomial time computable.

Which of the following CANNOT be true?
(A) L1 ∈ P and L2 is finite
(B) L1 ∈ NP and L2 ∈ P
(C) L1 is undecidable and L2 is decidable
(D) L1 is recursively enumerable and L2 is recursive


Answer: (C)

Explanation: We have one to one mapping for all instances of L1 to L2.

L1 is given to be undecidable. Further L1 is polynomial time reducible to L2. (By given mapping). Now if L2 is decidable then there is algorithm to solve L2 in polytime. But then we can solve every instance of L1 in polytime, making L1 also decidable. Contradiction


Quiz of this Question