Semi Infinite Tape Turing Machine
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 | 1RB---_1LB0RB
|
| BBt(3) | ≥ 12 | 0RB0LB_0RC1RC_1LA0LC
|
| BBt(4) | ≥ 168 | 1RB1LD_1RC0RC_1RD0LA_1LA0RD
|
| BBt(5) | ≥ 4,300 | 0RB0RC_0RC0RE_0RD1LE_1LA1RD_1LC1RB
|
| BBt(2,3) | ≥ 17 | 1RB0RA0RB_2LA2RB1LB
|
| BBt(3,3) | ≥ 10,053 | 0RB1LA1LB_0RC2LB1RB_1LA2LC2RC
|
| BBt(2,4) | ≥ 88 | 1RB2RB3LA2RA_1LA3LB0RB3RB
|
| BBt(2,5) | ≥ 415 | 0RB2LA1LB4RA2RB_1LA1RB3RB4LA1LA
|
| BBt(2,6) | ≥ 1,429 | 0RB4RB3LA2RA2LB2LA_1LA2RB5RA1RA3RA5RA
|