use rice’s theorem, which appears in problem 5.28, to prove the undecidability of each of the following languages.
Problem 5.28
Rice’s theorem. Let P be any nontrivial property of the language of a Turing machine. Prove that the problem of determining whether a given Turing machine’s language has property P is undecidable.
In more formal terms, let P be a language consisting of Turing machine descriptions where P fulfills two conditions. First, P is nontrivial—it contains some, but not all, TM descriptions. Second, P is a property of the TM’s language whenever TMs. Prove that P is an undecidable language.
