Blanking Busy Beaver Function

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

2 Symbols:	Steps	Champions
BLB(2)	$\geq 8$	1RB0RA_1LB1LA (bbch)
BLB(3)	$\geq 34$	1RB1LB_1LA1LC_1RC0LC (bbch)
BLB(4)	$\geq 32\,779\,477$	1RB1LD_1RC1RB_1LC1LA_0RC0RD (bbch)
BLB(5)	$\geq 32\,810\,047$	1RB1LC_1RD0LE_0RD0RC_1LD1LA_1RB1RE (bbch)
BLB(6)	$\geq 65\,538\,549$	1RB1LE_1RD1RB_0RD0RE_1LD1LA_0RF1RF_0LC1LC (bbch)

3 Symbols:	Steps	Champions
BLB(2,3)	$\geq 77$	1RB2LA0RB_1LA0LB1RA (bbch)

4 Symbols:	Steps	Champions
BLB(2,4)	$\geq 1\,367\,361\,263\,049$	1RB2RA1RA2RB_2LB3LA0RB0RA (bbch)

See also

• Instruction-Limited Blanking Busy Beaver