Let $$L_\emptyset = \{\langle M\rangle \mid M \text{ is a Turing Machine and }L(M)=\emptyset\}.$$
Is there a Turing machine R that Decides(I don't mean Recognizes) the language $L_\emptyset$?
Can a Turing machine decide the language $L_\emptyset$ of machines with empty language?
Mahdi
- 589
- 3
- 6
- 10