engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Rice's theorem states that
1
Every non-trivial property of recursively enumerable languages is undecidable.
2
Every non-trivial property of recursively enumerable languages is decidable.
3
Every property of recursively enumerable languages is undecidable.
4
Every property of recursively enumerable languages is decidable.