0 votes 0 votes Let $T = \{\langle M \rangle \mid \text{M is a TM that accepts $w^{R}$ whenever it accepts} \:w\}$. Show that $T$ is undecidable. Theory of Computation michael-sipser theory-of-computation turing-machine decidability proof + – admin asked Oct 19, 2019 admin 213 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.