Universal Turing machine: Difference between revisions
Content added Content deleted
m (use a semi-internal WP link) |
No edit summary |
||
Line 10:
'''Simple incrementer'''
* '''States:''' q0, qf
* '''Initial state:''' q0
* '''Terminating states:''' qf
* '''Permissible symbols:''' B, 1
Line 21 ⟶ 22:
'''Three-state busy beaver'''
* '''States:''' a, b, c, halt
* '''Initial state:''' a
* '''Terminating states:''' halt
* '''Permissible symbols:''' 0, 1
| |||