Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which one of the following statements is FALSE?
1
Turing decidable languages are closed under intersection and complementation.
2
Turing recognizable languages are closed under union and intersection.
3
Turing recognizable languages are closed under union and complementation.
4
{ap| p is prime number} is accepted by Turing Machine
5
Question Not Attempted