Anonymous user
Talk:Universal Turing machine: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 31:
: Then, ("s1", "a", "se", "b", left) means that we read a on the tape, switch from state s1 to state se, write b on the tape and move to the left. 0, 1, 2 are not tape symbols. You are right, thogh, that the tape looks something like this in the end: <tt>**aaaaaabbbbbbbb**</tt> --[[User:Coenig|Coenig]] 07:36, 19 February 2013 (UTC)
:: In the D implementation, we use different symbols, but the output is the same. [[User:Fwend|Fwend]] 16:16, 19 February 2013 (UTC)
::: Okay, now I see. That seems right to me, I get the blanks, too. (Didn't get that you were referring to the D implementation.) Should we add the example to the task definition? --[[User:Coenig|Coenig]] 19:11, 19 February 2013 (UTC)
| |||