Consider two languages L1 and L2 each on the alphabet Σ. Let f : Σ → Σ be a…

PYQ GATE 2003

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?

  1. A.

    L1 ∈ P and L2 is finite

  2. B.

    L1 ∈ NP and L2 ∈ P

  3. C.

    L1 is undecidable and L2 is decidable

  4. D.

    L1 is recursively enumerable and L2 is recursive

Attempted by 39 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…