Proving that Turing decidable languages are closed under reversal
Suppose that you have a Turing machine $M$ that accepts a language $L$.
Construct a new Turing machine which, on input $x$, reverses its input and then passes control to $M$. The new Turing machine accepts the reverse of $L$.