I'm trying to describe a TM through denotation of the transition function. Given is a TM that recognizes the language $$L ={\{w\#w} \mid w \in {\{0,1}\}^*\}$$over the input alphabet:$$\displaystyle\sum = {\{}0,1,\#\}$$My guess is first to place a word $$w \in {\sum}^*$$on the tape, and in every cell a symbol one after the other:and the rest would be denoted with squares. Something like this$$...w|\#|w|\square...$$the head would be on the first Symbol from $w$So I guess now I know that$$\Gamma = \{w,\#,\square\}$$I could probably try to make a table using what I have now:for $w$: $q_0 = (q_0,w,\#,R)$  R would be the direction the head is going$q_1 = (q_{yes},w,\#,N)$ N means the head doesn't move and $q_{yes}$ means that the TM accepts wIm not sure if what I'm doing is correct. I would appreciate if someone could tell me if I'm on the right track. 
Describe a TM through denotation of the transition function
terminology;turing machines;automata