Proving that $L=\{ \langle M \rangle \colon L(M)=L(M)^R \}$ is undecidable

Asked Jul 11 '15 at 18:01

Active Jul 11 '15 at 19:48

Viewed 60 times

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?

edited Jul 11 '15 at 19:48

Yuval Filmus

280,205
27
317
514

asked Jul 11 '15 at 18:01

Yotam

Proving that $L=\{ \langle M \rangle \colon L(M)=L(M)^R \}$ is undecidable

0 Answers0