0 votes 0 votes Show that the set of Turing-machine codes for TM's that accept all inputs that are palindromes (possibly along with some other inputs) is undecidable. Theory of Computation ullman theory-of-computation turing-machine undecidable descriptive + – admin asked Jul 21, 2019 admin 310 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.