Talk:Universal Turing machine: Difference between revisions
Content deleted Content added
No edit summary |
No edit summary |
||
Line 33:
::: 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)
:::: I think that's a good idea, provided that you use the same notation as the other examples. [[User:Fwend|Fwend]] 19:48, 19 February 2013 (UTC)
::::
<blockquote>
For instance:
<pre>
States: A, B, C, D, E, HALT
Initial state: A
Terminating states: HALT
Permissible symbols: 0, 1, 2, 3
Blank symbol: 0
Rules:
(A, 1, 1, right, A)
(A, 2, 3, right, B)
(A, 0, 0, left, E)
etc
Input: 12212212121212
Expected output: 0111111222222220
</pre>
BTW, I think we should add expected output the all the tasks. [[User:Fwend|Fwend]] 20:06, 19 February 2013 (UTC)
</blockquote>
|