0
$\begingroup$

Rice's theorem states that any nontrivial semantic property of Turing machines is undecidable.

However, when I opened “Classes of recursively enumerable sets and their decision problems” by H. G. Rice, I found a text far away from the above. Which result in the article corresponds to the above (slightly informal) formulation?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.