Semi Infinite Tape Turing Machine
Jump to navigation
Jump to search
The function BBt(n,m) returns the maximum number of right steps a Turing Machine with a semi infinite tape performs before its head leaves the tape. The head starts in the first cell and halting transition is not required.
| Domain | Value | Champion |
|---|---|---|
| BBt(2) | ≥ 3 | |
| BBt(3) | ≥ 12 | |
| BBt(4) | ≥ 168 | |
| BBt(5) | ≥ 4,300 | |
| BBt(2,3) | ≥ 17 | |
| BBt(3,3) | ≥ 10,053 | |
| BBt(2,4) | ≥ 88 | |
| BBt(2,5) | ≥ 415 | |
| BBt(2,6) | ≥ 1,429 | |