DEC: Decidable

M is a Turing Machine

Let I be an alphabet. A string ze is called a palindrome if z=z*, where za stands for the reverse of the string z. For example, for z=abcab, z* = bacba, so z is not a palindrome. Denote by P the set of all palindromes (over 3 ) and by the set of all non-palindromes Define A={{M) M accepts at least one palindrome) and prove that A & DEC. Let I be an alphabet. A string ze is called a palindrome if z=z*, where za stands for the reverse of the string z. For example, for z=abcab, z* = bacba, so z is not a palindrome. Denote by P the set of all palindromes (over 3 ) and by the set of all non-palindromes Define A={{M) M accepts at least one palindrome) and prove that A & DEC