prove that language is not decidable (string and reverse)

Asked Jun 12 '15 at 22:13

Active Jun 12 '15 at 22:22

Viewed 696 times

Prove that $T=\{\langle M\rangle\mid M \text{ is TM that accepts $w^R$ iff it accepts $w$}\} $ is not decidable. I have no idea how to start. Help me, please

edited Jun 12 '15 at 22:22

Michael Hardy

asked Jun 12 '15 at 22:13

user220688

3

Rice's theorem, maybe? (But I'm very rusty on this stuff.) ${}\qquad{}$ – Michael Hardy Jun 12 '15 at 22:23
Yes, It may helps me. Is there solution without this theorem ? – user220688 Jun 12 '15 at 22:41

prove that language is not decidable (string and reverse)

0 Answers0