Beeping Busy Beaver: Difference between revisions
mNo edit summary |
m (link Frontier) |
||
Line 1: | Line 1: | ||
The '''Beeping Busy Beaver''' (BBB) function is a variant of the [[Busy Beaver Functions|Busy Beaver function]] proposed by Scott Aaronson in his 2020 | The '''Beeping Busy Beaver''' (BBB) function is a variant of the [[Busy Beaver Functions|Busy Beaver function]] proposed by Scott Aaronson in his 2020 [[Busy Beaver Frontier]] survey.<ref name=":0">Scott Aaronson. "The Busy Beaver Frontier". https://www.scottaaronson.com/papers/bb.pdf</ref> It is notable because it is uncomputable even if you have access to a halting oracle for Turing Machines. | ||
== Definition == | == Definition == |
Revision as of 21:07, 30 June 2025
The Beeping Busy Beaver (BBB) function is a variant of the Busy Beaver function proposed by Scott Aaronson in his 2020 Busy Beaver Frontier survey.[1] It is notable because it is uncomputable even if you have access to a halting oracle for Turing Machines.
Definition
Consider a beeping Turing machine, which is a Turing machine that has a special state named "beep state". Every time the TM enters the "beep state" it beeps. There are two possibilities, either this TM beeps a finite number of times (and thus there is a final beep) or it never stops beeping. Nick Drozd coined the term quasihalting to describe the event when a TM last beeps. A TM quasihalts if it beeps only a finite number of times.[2] The Beeping Busy Beaver problem is analogous to the Busy Beaver problem, replacing halting with quasihalting. In other words, let be the number of steps the machine M takes until it quasihalts (beeps for the last time) if it quasihalts (we will say if the TM never stops beeping). Then
where is the set of Turing machines with states and two symbols.
Note that these Turing machines need not ever halt, so the Tree Normal Form algorithm needs to be modified (to allow TMs with no halt transitions) when searching for BBB champions.
Significance
It is easy to see that , by letting the beep state be the state that is reached immediately before the halt state.
Values may occur when the machine emits a beep before entering non-halting behavior.
Moreover, it turns out that grows uncomputably faster than (as fast as BB augmented with a halting oracle).
Results
- BBB(1) = 1[1]
- BBB(2) = 6[1]
- BBB(3) = 55
- BBB(4) ≥ 32,779,478
- BBB(5) ≥ 1014,006[3] and probably due to a "probviously" halting Cryptid.[4]
All known champions quasihalt by becoming Translated Cyclers, a property which is known to be weaker than the general quasihalting condition.
References
- ↑ 1.0 1.1 1.2 Scott Aaronson. "The Busy Beaver Frontier". https://www.scottaaronson.com/papers/bb.pdf
- ↑ Nick Drozd. Beeping Busy Beavers. https://nickdrozd.github.io/2020/08/13/beeping-busy-beavers.html
- ↑ Nick Drozd. https://scottaaronson.blog/?p=8088#comment-1981333
- ↑ Shawn Ligocki. Mother of Giants.https://www.sligocki.com/2022/04/03/mother-of-giants.html