I'm trying to show that$L=\{ \langle M \rangle \colon L(M)=L(M)^R\}$ is undecidable, but I don't even know where to begin. Google wasn't much of a help, maybe because it's hard describing the language in words. Any hints? 
Proving that $L=\{ \langle M \rangle \colon L(M)=L(M)^R \}$ is undecidable
computability;undecidability