0 votes 0 votes Let $E_{TM} = \{\langle{ M \rangle } \mid M\: \text{is a TM}\: \text{and}\: L(M) = \phi\}$. Show that $E_{TM}$, the complement of $E_{TM}$, is Turing-recognizable. Theory of Computation michael-sipser theory-of-computation turing-machine recursive-and-recursively-enumerable-languages proof + – admin asked Oct 17, 2019 admin 137 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.