edited tags

Link

edited Feb 25, 2018 at 11:18

Raphael

72.9k
30
181
393

Post Merged (destination) from cs.stackexchange.com/questions/10911/…

occurred Apr 3, 2013 at 7:03

adds proposition for sake of the merged question.

Source Link

edited Apr 3, 2013 at 7:03

Raphael

72.9k
30
181
393

Let $$L_\emptyset = \{\langle M\rangle \mid M \text{ is a Turing Machine and }L(M)=\emptyset\}.$$
Is there a Turing machine R that Decidesdecides (I don't mean Recognizesrecognizes) the language $L_\emptyset$?

It seems that the same technique used to show that $\{A \mid A \text{ is a DFA and } L(A)=\emptyset\}$ should work here as well.

Tweeted twitter.com/#!/StackCompSci/status/317998334679859200

occurred Mar 30, 2013 at 13:54

added 23 characters in body; edited tags; edited title

Source Link

edited Mar 29, 2013 at 20:59

Ran G.

20.8k
3
60
116

Can a Turing machine decide the language $L_\emptyset$ of machines with empty language?

Let $A = \{\langle M\rangle | M $ is a Turing Machine and $L(M)=\emptyset\}$ .$$L_\emptyset = \{\langle M\rangle \mid M \text{ is a Turing Machine and }L(M)=\emptyset\}.$$
We want to writeIs there a Turing machine R that Decides(I don't mean Recognizes) the language A.$L_\emptyset$?