1
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.

A is recursive if both a and its complement are accepted by Turing Machine M accepts.

A
TRUE
B
FALSE
2
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE. The problem is to whether a Turing Machine M accepts input $$w$$ is un-decidable.

A
TRUE
B
FALSE
3
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
Recursive languages are:
A
A proper superset of context free languages.
B
Always recognizable by pushdown automata.
C
Also called Type $$(0)$$ languages.
D
Recognizable by Turing machines.
4
GATE CSE 1990
MCQ (More than One Correct Answer)
+2
-0.6
It is decidable whether:
A
An arbitrary Turing machine halts after 10 steps.
B
A Turing machine prints a specific letter.
C
A Turing machine computes the product of two numbers.
D
None of the above.
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12