I'm trying to build a Turing machine diagram for the language w#w^R, where w^R is the reverse of w, and w is a word made up of 0's and 1's. I'm trying to think of an algorithm but I can't think of something not extremely complicated that goes over all combinations of the alphabet for a given word length, then type # onto the print tape and copies it back in reverse.
Is there something I'm missing here? Could there be a simpler algorithm here?
Thanks in advance.