Computer Science, asked by juleedas90, 1 month ago

which of the following statement is correct?
a) The nested Turning machines can simulate other Turning machine.
b) Boolean Satisfiability problem is unsolvable.
c) The Recursive enumerated language cannot be accepted by a Turning machine.
d) Turning recognizable languages are closed under union.

Answers

Answered by anushkachauhan620
0

Answer:

option (C) is correct

hope its helpful

Answered by vijaylaxmimishra28
0

Answer:

I think option c is correct

if my answer is correct pls mark me as brainliest and if not then also pls mark me as brainliest

Similar questions