Let
PALTM = { | M is a Turing machine that accepts only palindromes}.
Remember that denotes the string that represents a machine M. Show that PALTM is undecidable using a direct argument. By a "direct argument," what we mean is something that provides an explicit reduction and does not take recourse to Rice's theorem.
2. Show that the following languages are undecidable using Rice's theorem. Note that you must use Rice's theorem for credit in this problem.
1) The language PALTM above.
2) OL = { | M is a Turing machine that accepts only only odd length strings}.