engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
The Halting problem of Turing machines is
1
recursive
2
recursively enumerable but not recursive
3
recursive but not recursively enumerable
4
not recursively enumerable