Anonymous user
Talk:Universal Turing machine: Difference between revisions
→Examples sufficient to find bugs in UTM?
m (→Examples sufficient to find bugs in UTM?: highlighting/formatting) |
|||
Line 26:
: We get: 0111111222222220. The blanks on both ends seem to be in the rules, don't you get them? Unless I'm not reading it correctly: the very last rule, for instance, writes a blank just before he goes to the halting position, so it has to be part of the output.[[User:Fwend|Fwend]] 20:36, 17 February 2013 (UTC)
: I don't think that you understood my TM definition correctly (or I'm wrong in understanding what you mean). I used a different notation than on the main site. In my TM s1, s2, ... are the states, a, b are the tape symbols, and * is the blank symbol.
: 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. --[[User:Coenig|Coenig]] 07:36, 19 February 2013 (UTC)
| |||