Sports GK Questions and Answers 2024 (Latest Updated)

Awards & Honours GK Questions 2024 (Latest Updated)

Question

Which of the following statements is/are FALSE?

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]

Advertisement
Article and Schedule Quiz Start Test!
DOWNLOAD CURRENT AFFAIRS PDF FROM APP

Random GK Questions

Assam Direct Recruitment Test Series

Teacher Eligibility Test

Assam Direct Recruitment Test Series