JNU 2018-2 PhD CS
October 26, 2023JNU 2018-2 PhD CS
October 26, 2023JNU 2018-2 PhD CS
|
Question 3
|
A language L may not be accepted by a Turing machine if
|
it is recursively enumerable
|
|
|
L can be enumerated by some Turing machine
|
|
|
it is recursive
|
|
|
None of the above
|
Question 3 Explanation:
A language L may not be accepted by a Turing machine if L is not recursively enumerable. But note that if L is recursively enumerable then it will be definitely accepted by TM.
Correct Answer: D
Question 3 Explanation:
A language L may not be accepted by a Turing machine if L is not recursively enumerable. But note that if L is recursively enumerable then it will be definitely accepted by TM.
Subscribe
Login
0 Comments