Non-Deterministic Turing Machine Algorithm I'm having trouble with this question:
Write a simple program/algorithm for a nondeterministic Turing machine that accepts the language:
$$
L = \left\{\left. xw w^R y \right| x,y,w \in \{a,b\}^+, |x| \geq |y|\right\}
$$

As TaraB hints at, the language is really context free:
$$
\begin{align*}
S &\rightarrow A S A \\
A &\rightarrow a \mid b \mid c \\
B &\rightarrow A B A \mid A B \mid a a \mid b b \mid c c
\end{align*}
$$
Here the $S$ production serves to ensure $x$ and $y$ have length at least 1, $A$ serves to give a single symbol for compactness, the $B$ productions add something at the beginning and end, and allow $x$ longer than $y$,  and finally place a $aa$, $bb$, or $cc$ (off-)center.
