Original Turing Machine by Grégory Apou.
| Examples: | - - |
Alphabet: Σ = {>, #, }
|
Nonhalting states: {} Halting states: H = {} |
All states: K = {} |
| transitions | |||
| q | σ | δ(q, σ) | |
Initial configuration: (, >, )
Maximum number of steps:
Transition results: