Maximum Space Function
Jump to navigation
Jump to search
The Maximum Space function (named by Ben-Amram)[1] is a Busy Beaver function which measures the total number of tape cells read before halting. According to Ben-Amram, it includes the starting cell, but not necessarily the cell the halting transition moves to.
Champions
| Domain | Champion TM | |
|---|---|---|
| BB(1) | 1 | 1RZ--- (bbch)
|
| BB(2) | 4 | 1RB1LB_1LA1RZ (bbch), 1RB0LB_1LA1RZ (bbch)
|
| BB(3) | 7 | 1RB1RC_1LC1RZ_1RA0LB (bbch), 1RB0RC_1LC1RZ_1RA0LB (bbch)
|
| BB(4) | 16 | 1RB0RA_1LC0RD_0LD0LB_1RA1RZ (bbch)
|
| BB(5) | 12289 | 1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA (bbch)
|
| BB(2,3) | 9 | 1RB2LB1RZ_2LA2RB1LB (bbch)
|
| BB(2,4) | 2050 | 1RB2LA1RA1RA_1LB1LA3RB1RZ (bbch)
|
References
- ↑ Ben-Amram A.M., Julstrom B.A. and Zwick U. (1996). A note on busy beavers and other creatures. Mathematical Systems Theory 29 (4), July-August 1996, 375-386.