Blanking Busy Beaver Function: Difference between revisions
Jump to navigation
Jump to search
(Added references section) |
m (inexistent -> nonexistent) |
||
| Line 9: | Line 9: | ||
|- | |- | ||
|BLB(1) | |BLB(1) | ||
| | | | ||
| | |nonexistent | ||
|- | |- | ||
|BLB(2) | |BLB(2) | ||
| Line 31: | Line 31: | ||
|- | |- | ||
|BLB(1,3) | |BLB(1,3) | ||
| | | | ||
| | |nonexistent | ||
|- | |- | ||
|BLB(2,3) | |BLB(2,3) | ||
| Line 45: | Line 45: | ||
|- | |- | ||
|BLB(1,4) | |BLB(1,4) | ||
| | | | ||
| | |nonexistent | ||
|- | |- | ||
|BLB(2,4) | |BLB(2,4) | ||
Revision as of 20:24, 27 August 2025
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) | nonexistent | |
| BLB(2) | [1] | 1RB0RA_1LB1LA (bbch)
|
| BLB(3) | [2] | 1RB1LB_1LA1LC_1RC0LC (bbch)
|
| BLB(4) | 1RB1LD_1RC1RB_1LC1LA_0RC0RD (bbch)
|
| 3 Symbols: | Steps | Champions |
|---|---|---|
| BLB(1,3) | nonexistent | |
| BLB(2,3) | [2] | 1RB2LA0RB_1LA0LB1RA (bbch)
|
| 4 Symbols: | Steps | Champions |
|---|---|---|
| BLB(1,4) | nonexistent | |
| BLB(2,4) | [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.