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.

Champions


2 Symbols:	Steps	Champions
BLB(1)	inexistent	inexistent
BLB(2)	$\geq 8$ ^[1]	`1RB0RA_1LB1LA` (bbch)
BLB(3)	$\geq 34$ ^[2]	`1RB1LB_1LA1LC_1RC0LC` (bbch)
BLB(4)	$\geq 32 779 477$	`1RB1LD_1RC1RB_1LC1LA_0RC0RD` (bbch)


3 Symbols:	Steps	Champions
BLB(1,3)	inexistent	inexistent
BLB(2,3)	$\geq 77$ ^[2]	`1RB2LA0RB_1LA0LB1RA` (bbch)


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

References

↑ Nick Drozd. "Blanking Beavers". Accessed 15 August 2025.
↑ ^2.0 ^2.1 ^2.2 Nick Drozd. "Latest Beeping Busy Beaver Results". Accessed 15 August 2025.

[:3-1] Nick Drozd. "Blanking Beavers". Accessed 15 August 2025.

[:4-2] 2.0 ^2.1 ^2.2 Nick Drozd. "Latest Beeping Busy Beaver Results". Accessed 15 August 2025.

[1]

[2]

Blanking Busy Beaver Function

Champions

References

Navigation menu

Search