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.

  • 1
    $\begingroup$ This may answer your question :cs.stackexchange.com/questions/37818/… $\endgroup$
    – PleaseHelp
    Feb 1, 2015 at 16:16
  • $\begingroup$ I think you are confusing Turing machines with their domain. $\endgroup$
    – Pål GD
    Feb 1, 2015 at 17:17
  • $\begingroup$ How do you distinguish a Turing Machine from a non-Turing Machine? $\endgroup$
    – babou
    Feb 1, 2015 at 19:55
  • $\begingroup$ I just simplified the question, I'm wondering about the language of all Turing machine descriptions, is that recognizable? $\endgroup$
    – yekta
    Feb 1, 2015 at 21:19
  • 1
    $\begingroup$ What is a Turing Machine Description (for the purpose of your question) ? $\endgroup$
    – babou
    Feb 1, 2015 at 21:32