Which of the following statements is correct?
a) The nested Turing machines can simulate other Turing machines,
b) Boolean satisfiability problem is unsolvable,
c) The Recursive enumerated language cannot be accepted by a Turing machine,
d) Turing recognizable languages are closed under union,
Answers
Answered by
50
Answer:
option c is correcte.....
Answered by
10
Answer:
D
Explanation:
it supports every language
Similar questions