0

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.

Raphael
  • 72,336
  • 29
  • 179
  • 389
yekta
  • 109
  • 3
  • 1
    This may answer your question :http://cs.stackexchange.com/questions/37818/language-consisting-of-all-turing-machine-encodings – PleaseHelp Feb 01 '15 at 16:16
  • I think you are confusing Turing machines with their domain. – Pål GD Feb 01 '15 at 17:17
  • How do you distinguish a Turing Machine from a non-Turing Machine? – babou Feb 01 '15 at 19:55
  • I just simplified the question, I'm wondering about the language of all Turing machine descriptions, is that recognizable? – yekta Feb 01 '15 at 21:19
  • This seems to be the same question as http://cs.stackexchange.com/q/37818/9550 but we can't close as a dupe because that one doesn't have an answer. – David Richerby Feb 01 '15 at 21:27
  • 1
    What is a Turing Machine Description (for the purpose of your question) ? – babou Feb 01 '15 at 21:32
  • A Turing machine description is a string description of how the machine operates. So think of some C program code string identifying how the compiled code behaves. – yekta Feb 01 '15 at 21:39
  • Well, if that is what you consider a description (some people might disagree), what would you say about recognizability of C programs? By the way, you should state that explicitly in your question if you want to have it reopened, since it would make it different from the other one. Understanding why might teach you something important. – babou Feb 01 '15 at 22:40

0 Answers0