Discuss the below:
Q: Let A be a turing-recognizable language consisting of descriptions of Turing machines, {, ,...}, 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 find it helpful to consider an enumerator for A.)