Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?
L={⟨M⟩∣ M halts on all palindromes}.
How can i use Rice's theorem here?
Tyes={All palidroms} Tno={Signma*}.Will that work here?
M halts on all palindromes means M halts on only palindromes ?