Semi-Infinite Turing Machine: Difference between revisions

Latest revision as of 05:19, 25 October 2026

Redirect to:

@@ Line 1: / Line 1: @@
-This is a work in progress.
+#REDIRECT [[Semi_Infinite_Tape_Turing_Machine]]
-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]]