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$?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.
Can a Turing machine decide the language $L_\emptyset$ of machines with empty language?
turing machines;undecidability