The Blanking Busy Beaver Function (BLB(n,m)) is a Busy Beaver Function which measures the largest amount of steps done by any Turing machine with n states and m symbols before blanking the tape. Blanking Busy Beaver machines are allowed to be halting or non-halting. As machines with just a single state cannot blank the tape, BLB(1,m) is nonexistent for any amount of symbols m. Similarly, BLB(n,1) is nonexistent for any amount of states n, as the tape of 1-symbol machines is always blank.
Champions
3 Symbols:
|
Steps
|
Champions
|
BLB(2,3)
|
[2]
|
1RB2LA0RB_1LA0LB1RA (bbch)
|
4 Symbols:
|
Steps
|
Champions
|
BLB(2,4)
|
[2]
|
1RB2RA1RA2RB_2LB3LA0RB0RA (bbch)
|
See also
References