Give a description of a Turing machine that recognizes the following languages. Do not give states, but you should describe what state control and tape head are doing in each part of your approach. You may use non-determinism, but only use a single tape.

L = {x#y | x, y {0,1} and x is a binary integer greater than y}