Let A be a Turing-recognizable language consisting of
Chapter , Problem 4.30(choose chapter or problem)
Let A be a Turing-recognizable language consisting of descriptions of Turing machines, {hM1i,hM2i, ...}, where every Mi is a decider. Prove that some decidable language D is not decided by any decider Mi whose description appears in A. (Hint: You may nd it helpful to consider an enumerator for A.)
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