Semi-Infinite Turing Machine

From BusyBeaverWiki
Revision as of 05:18, 25 October 2026 by 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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.

Retrieved from "https://wiki.bbchallenge.org/w/index.php?title=Semi-Infinite_Turing_Machine&oldid=9545"