Use Rices theorem, which appears in 5.28, to prove the
Chapter , Problem 5.30(choose chapter or problem)
Use Rices theorem, which appears in 5.28, to prove the undecidability of each of the following languages. Aa. INFINITETM = {hMi| M is a TM and L(M) is an innite language}. b. {hMi| M is a TM and 1011 L(M)}. c. ALLTM = {hMi| M is a TM and L(M) = }.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer