Gate CS-2016-2 Question Paper With Solutions

Q.54 Consider the following languages.

L1 = { <M>  | M takes at least 2016 steps on some input},
L2 = { <M>  | M takes at least 2016 steps on all inputs} and
L3 = { <M>  | M accepts ε},

where for each Turing machine M,   <M> denotes a specific encoding of M.

Which one of the following is TRUE?

(A) L1 is recursive and L2, L3 are not recursive

(B) L2 is recursive and L1, L3 are not recursive

(C) L1, L2 are recursive and L3 is not recursive

(D) L1, L2, L3 are recursive

Answer: (C)

Explanation:

Gate CS-2016-2 Question Paper With Solutions

Learn More:   Gate ME-2017-1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here