Busy Beaver Functions: Difference between revisions
(Add Ben-Amram and space function) |
(grammar fixes) |
||
| Line 1: | Line 1: | ||
The Busy Beaver Game is the search for Turing machines which maximize various '''Busy Beaver Functions'''. All Busy Beaver functions are non-computable. There are several, related functions with different authors referring | The Busy Beaver Game is the search for Turing machines which maximize various '''Busy Beaver Functions'''. All Busy Beaver functions are non-computable. There are several, related functions with different authors referring to one or the other as "the Busy Beaver function". Therefore, it is recommended that you use a more specific designation when referring to one specific Busy Beaver function. | ||
The two most commonly used Busy Beaver functions are: | The two most commonly used Busy Beaver functions are: | ||
| Line 10: | Line 10: | ||
Ben-Amram calls this the <math>time(n)</math> function.<ref name=":0">Ben-Amram A.M., Julstrom B.A. and Zwick U. (1996). [http://dx.doi.org/10.1007/BF01192693 A note on busy beavers and other creatures]. ''Mathematical Systems Theory'' '''29''' (4), July-August 1996, 375-386.</ref> Harland calls it the "frantic frog" function <math>ff(n)</math>.<ref name=":1">James Harland. [https://dl.acm.org/doi/pdf/10.5555/1151785.1151794 The Busy Beaver, the Placid Platypus and other Crazy Creatures]. 2006.</ref> | Ben-Amram calls this the <math>time(n)</math> function.<ref name=":0">Ben-Amram A.M., Julstrom B.A. and Zwick U. (1996). [http://dx.doi.org/10.1007/BF01192693 A note on busy beavers and other creatures]. ''Mathematical Systems Theory'' '''29''' (4), July-August 1996, 375-386.</ref> Harland calls it the "frantic frog" function <math>ff(n)</math>.<ref name=":1">James Harland. [https://dl.acm.org/doi/pdf/10.5555/1151785.1151794 The Busy Beaver, the Placid Platypus and other Crazy Creatures]. 2006.</ref> | ||
In his 2020 | In his 2020 survey, Scott Aaronson used the notation <math>BB(n, m)</math> for the Max Shift function and referred to it as "the" Busy Beaver function.<ref>Scott Aaronson. [https://scottaaronson.blog/?p=4916 The Busy Beaver Frontier]. 2020.</ref> | ||
== Max Score Function Σ(n, m) == | == Max Score Function Σ(n, m) == | ||
| Line 18: | Line 18: | ||
== Other Busy Beaver functions == | == Other Busy Beaver functions == | ||
In addition to the above functions, there are a couple others that have appeared in the literature: | In addition to the above functions, there are a couple of others that have appeared in the literature: | ||
* Maximum space: Ben-Amram call this <math>space(n)</math><ref name=":0" />, bbchallenge calls it <code>BB_SPACE(n)</code> or <math>BB_{space}(n)</math>. This is 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. | * Maximum space: Ben-Amram call this <math>space(n)</math><ref name=":0" />, bbchallenge calls it <code>BB_SPACE(n)</code> or <math>BB_{space}(n)</math>. This is 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. | ||
* Maximum consecutive ones: Ben-Amram | * Maximum consecutive ones: Ben-Amram calls this <math>num(n)</math>.<ref name=":0" /> A TM only qualifies if it halts with all ones consecutive on tape. | ||
== References == | == References == | ||
<references /> | <references /> | ||
Revision as of 02:35, 24 July 2024
The Busy Beaver Game is the search for Turing machines which maximize various Busy Beaver Functions. All Busy Beaver functions are non-computable. There are several, related functions with different authors referring to one or the other as "the Busy Beaver function". Therefore, it is recommended that you use a more specific designation when referring to one specific Busy Beaver function.
The two most commonly used Busy Beaver functions are:
- The Maximum Shift function which is the most commonly used Busy Beaver function by bbchallenge and is generally called here.
- The Maximum Score function which is Tibor Radó's original Busy Beaver function.
Max Shift Function S(n, m)
The Maximum Shift or Maximum Step function is the largest number of steps (or shifts) that any Turing machine (of a certain size) takes before halting. It was introduced by Tibor Radó in his seminal Busy Beaver paper.[1] He used the notation to define it for Turing machines with states and 2 symbols. This was later extended to for states and symbols. Notably, the halting transition counts as a step, so the TM with rule A0 -> 1RZ halts in 1 step.
Ben-Amram calls this the function.[2] Harland calls it the "frantic frog" function .[3]
In his 2020 survey, Scott Aaronson used the notation for the Max Shift function and referred to it as "the" Busy Beaver function.[4]
Max Score Function Σ(n, m)
The Maximum Score function is the largest number of ones (or non-zero symbols in general) left on the tape by any halting Turing machine (of a certain size) at the moment it halts. It was also introduced by Tibor Radó in his seminal paper. He called it the "score" of the Turing machine. He used the notation to define it for Turing machines with states and 2 symbols. This was later extended to for states and symbols.
Ben-Amram calls this the function.[2] Harland calls it the "busy beaver" function .[3] Before Aaronson's survey, this was the function that most people called "the" Busy Beaver function.
Other Busy Beaver functions
In addition to the above functions, there are a couple of others that have appeared in the literature:
- Maximum space: Ben-Amram call this [2], bbchallenge calls it
BB_SPACE(n)or . This is 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. - Maximum consecutive ones: Ben-Amram calls this .[2] A TM only qualifies if it halts with all ones consecutive on tape.
References
- ↑ Tibor Radó (May 1962). "On non-computable functions" (PDF). Bell System Technical Journal. 41 (3): 877–884. https://doi.org/10.1002%2Fj.1538-7305.1962.tb00480.x
- ↑ 2.0 2.1 2.2 2.3 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.
- ↑ 3.0 3.1 James Harland. The Busy Beaver, the Placid Platypus and other Crazy Creatures. 2006.
- ↑ Scott Aaronson. The Busy Beaver Frontier. 2020.