Maximum Space Function
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_1LA1LZ (bbch)
|
| BB(3) | 6 | 1RB1LC_1RC1LZ_1LA0LB (bbch)
|
| BB(4) | 12 | 1RB0LA_1RC1LB_1LB1RD_1RZ0RA (bbch)
|
| BB(5) | 165 | 1RB1LA_1RC1LE_1RD1RE_0LA1RC_1RZ0LB (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.