Affiliation:
1. University of Texas at Austin, Austin, TX, USA
Abstract
The Busy Beaver function, with its incomprehensibly rapid growth, has captivated generations of computer scientists, mathematicians, and hobbyists. In this survey, I o er a personal view of the BB function 58 years after its introduction, emphasizing lesser-known insights, recent progress, and especially favorite open problems. Examples of such problems include: when does the BB function rst exceed the Ackermann function? Is the value of BB(20) independent of set theory? Can we prove that BB(n + 1) > 2BB(n) for large enough n? Given BB(n), how many advice bits are needed to compute BB(n + 1)? Do all Busy Beavers halt on all inputs, not just the 0 input? Is it decidable, given n, whether BB(n) is even or odd?
Publisher
Association for Computing Machinery (ACM)
Reference14 articles.
1. Improved Bounds for Functions Related to Busy Beavers
2. The determination of the value of Rado's noncomputable function (k) for four-state Turing machines;Brady A. H.;Mathematics of Computation,1983
3. On the restricted ordinal theorem
4. A lower bound RADO's sigma function for binary turing machines
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献