Intermediate Theory of Computation
Q45 / 100

What is Rice's theorem?

Correct! Well done.

Incorrect.

The correct answer is B) Every non-trivial semantic property of Turing machine languages is undecidable

B

Correct Answer

Every non-trivial semantic property of Turing machine languages is undecidable

Explanation

Rice's theorem: for any non-trivial property P of RE languages (neither all TMs nor no TMs have it), the problem of deciding whether TM M has property P is undecidable.

Previous All Questions Next
Progress
45/100
🤖

Browse All Theory of Computation Questions

100 questions · beginner to advanced