Question 1 (12 Marks)
Let T = {<M> | M is a TM that accepts wR whenever it accepts w}. Show that T is undecidable.
wR: w written backwards (e.g. if w = 010111 then wR = 111010)
SOLUTION:
Let T = {<M> | M is a TM that accepts wR whenever it accepts w}. Show that T is undecidable.
wR: w written backwards (e.g. if w = 010111 then wR = 111010)
SOLUTION: