Which of the following statements is/are FALSE?

Question

I. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine

II. Turing recognizable languages are closed under union and complementation

III. Turing decidable languages are closed under intersection and complementation

IV. Turing recognizable languages are closed under union and intersection

[A] I and IV only

[B] I and III only

[C] II only

[D] III only

Answer & Explanation
Answer: Option [C]