Theorem 6.1

Theorem 6.1 (Classical palindrome interface (classical, imported)). There are finite $m,Q,T$ and a total strict real-time $m$-tape machine $P$ such that, for every $x\in\{0,1\}^*$, the state reached after exactly $|x|$ transitions is accepting if and only if $x=x^R$. The statement includes $x=\varepsilon$: the initial state is accepting.