Semi-Infinite Turing Machine: Difference between revisions
Jump to navigation
Jump to search
Loader3229 (talk | contribs) Created page with "This is a work in progress. A semi-infinite Turing Machine is a Turing Machine that use a tape that only one direction is infinite instead. The tape has a left bound, and the pointer is initially located at the cell right to the bound. If the machine's pointer is the cell right to the bound and try to go left, its pointer will stay on the cell instead. BB_SI(n,m) is = Maximum number of steps taken by a halting n-state, m-symbol semi-infinite Turing machine starting fro..." |
Loader3229 (talk | contribs) No edit summary |
||
| Line 6: | Line 6: | ||
BB_SI(n,m) is = Maximum number of steps taken by a halting n-state, m-symbol semi-infinite Turing machine starting from a blank (all 0) semi-infinite tape. | BB_SI(n,m) is = Maximum number of steps taken by a halting n-state, m-symbol semi-infinite Turing machine starting from a blank (all 0) semi-infinite tape. | ||
[Category:Functions] | |||
Revision as of 05:18, 25 October 2026
This is a work in progress.
A semi-infinite Turing Machine is a Turing Machine that use a tape that only one direction is infinite instead. The tape has a left bound, and the pointer is initially located at the cell right to the bound. If the machine's pointer is the cell right to the bound and try to go left, its pointer will stay on the cell instead.
BB_SI(n,m) is = Maximum number of steps taken by a halting n-state, m-symbol semi-infinite Turing machine starting from a blank (all 0) semi-infinite tape.
[Category:Functions]