Maximum Space Function: Difference between revisions
Jump to navigation
Jump to search
Added Maximum Space Function page |
mNo edit summary |
||
| Line 20: | Line 20: | ||
|- | |- | ||
|[[BB(4)]] | |[[BB(4)]] | ||
| | |14 | ||
|{{TM| | |{{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}} | ||
|- | |- | ||
|[[BB(5)]] | |[[BB(5)]] | ||
| | |> 4098 | ||
|{{TM| | |{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}} | ||
|} | |} | ||
== References == | == References == | ||
<references /> | <references /> | ||
Revision as of 07:34, 20 September 2025
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) | 14 | 1RB1LB_1LA0LC_1RZ1LD_1RD0RA (bbch)
|
| BB(5) | > 4098 | 1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA (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.