Is the language of the set of descriptions of all Turing machines recognizable?  I'm thinking not, but I can't quite define why.A language is Turing-recognizable if some Turing machine recognizes it.  So I guess I'm wondering if the language L of all Turing machine descriptions is Turing-recognizable.
Are all Turing machines recognizable?
computability;turing machines;semi decidability