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

ADRE 2.0 FULL LENGTH MOCK TEST

Take Mock Tests

Missiles Mock Test Start Test!
SSC MTS Mock Test Start Test
IBPS CLERK MOCK TEST Start Test
SSC MTS 2022 JULY 26 Shift 1 (ENGLISH) Start Test!
SSC GD Previous Year Paper 2021 Nov 17 Shift - I (Hindi) Start Test!
SSC CGL Tier - 1 PYP 2022 April 21 Shift- 1 (ENGLISH) Start Test!
MPSC PAPER I MOCK TEST 1 (ENGLISH) Start Test!
IB Security Assistant Mock test 1 (english) Start Test!
UP POLICE CONSTABLE MOCK TEST 1 Start Test!
DELHI POLICE CONSTABLE MOCK TEST 1 (HINDI) Start Test!