login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060843 Busy Beaver problem: a(n) = maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting. 8
1, 6, 21, 107 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
"In 1965 Tibor Rado, together with Shen Lin, proved that a(3) is 21. (...) Next, in 1983, Allan Brady proved that a(4) is 107. (...) Then in 1989 Heiner Marxen and Juergen Buntrock discovered that a(5) is at least 47176870. (...) As for a(6), Marxen and Buntrock set another record in 1997 by proving that it is at least 8690333381690951." [Based on Aaronson's web page.]
The function Sigma(n) = Sigma(n, 2) (A028444) denotes the maximal number of tape marks (1's) that a Turing Machine with n internal states (plus the Halt state), 2 symbols, and a two-way infinite tape can write on an initially blank tape (all 0's) and then halt. The function a(n) (the present sequence) denotes the maximal number of steps S(n) = S(n, 2) (thus shifts, since direction NONE is excluded) that such a machine can make (not necessarily the same Turing machine producing a maximum number of 1s and need not even produce many tape marks).
Given that 5-state 2-symbol halting Turing machines can compute Collatz-like congruential functions (see references), it may be very hard to find the next term.
The sequence grows faster than any computable function of n and so is noncomputable.
From Daniel Forgues, Jun 05-06 2011: (Start)
A more precise definition might be as follows:
Busy Beaver Problem: a(n) is the maximal number of steps that an n-state, 2-symbol, d+ in {LEFT, RIGHT}, 5-tuple (q, s, q+, s+, d+) Turing machine can make on an initially blank tape and then halt.
Further comments:
H in H_(n, k) is a halting* Turing machine with n states and k symbols;
* (on a blank tape (all 0's) as input)
States q, q+ in set Q_n of n distinct states (plus the Halt state);
Symbols s, s+ in set S_k of k distinct symbols (0 as the blank symbol);
Shift direction d+ in {LEFT, RIGHT} (NONE is excluded here);
sigma(H) is the number of non-blank symbols left on the tape by H;
s(H) is the number of steps (or shifts in our case) taken by H;
Sigma(n, k) = max {sigma(H) : H is a halting Turing machine with n states and k symbols}
S(n, k) = max {s(H) : H is a halting Turing machine with n states and k symbols}
a(n) is S(n) = S(n, 2) since a 2-symbol BB-class Turing machine is assumed.
For all n, S(n, k) >= Sigma(n, k), k >= 2. (End)
a(6) > 10^^15, a tower of 10's of height 15 [Pavel Kropitz] - see Shawn Ligocki's blog. - N. J. A. Sloane, Jun 22 2022
It is conjectured that a(5) = 47176870 (Conjecture 10 of the Scott Aaronson link "The busy beaver frontier"). - Jianing Song, Feb 21 2024
REFERENCES
A. H. Brady, The busy beaver game and the meaning of life, in Herken, R. (Ed) The Universal Turing Machine: A Half-Century Survey, pp. 259-277, Oxford Univ Press 1988. Reprinted by Springer-Verlag, 1995 (see pages 237-254).
J. C. Lagarias, ed., The Ultimate Challenge: The 3x+1 Problem, Amer. Math. Soc., 2010; see p. 33.
Yu. V. Rogozhin, Seven universal Turing machines (Russian), abstract, Fifth All-Union Conference on Math. Logic, Akad. Nauk. SSSR Sibirsk. Otdel., Inst. Mat., Novosibirsk, 1979, p. 127.
Yu. V. Rogozhin, Seven universal Turing machines (Russian), Systems and Theoretical Programming, Mat. Issled. no. 69, Akademiya Nauk Moldavskoi SSSR, Kishinev, 1982, pp. 76-90.
Jeffrey Shallit, A second course in formal languages and automata theory. Cambridge University Press, 2008. See Fig. 6.2, p. 185.
LINKS
Scott Aaronson, The busy beaver frontier, ACM SIGACT News 51.3 (2020): 32-54.
Bill Dubuque, Re: Halting is weak
A. Gravell and U. Ultes-Nitsche, BB(n) Grows Faster Than Any Computable Function [dead link]
Shawn Ligocki, BB(6,2) > 10^^15, Jun 21 2022.
Shen Lin and T. Rado, Computer Studies of Turing Machine Problems, J. ACM 12 (1965), 196-212.
Rona Machlin (nee Kopp) and Quentin F. Stout, The Complex Behavior of Simple Machines, Physica D 42 (1990) 85-98.
Pascal Michel, Busy beaver competition and Collatz-like problems, Arch. Math. Logic (1993) 32:351-367.
Pascal Michel, Historical survey of Busy Beavers, 2011.
Pascal Michel, Behavior of busy beavers, 2010.
Pascal Michel, The Busy Beaver Competitions, 2010.
T. Rado, On Non-Computable Functions, Bell System Technical J. 41 (1962), 877-884.
Raphael M. Robinson, Minsky's small universal Turing machine, Int'l Jnl. Math, 2 #5 (1991) 551-562.
Claude E. Shannon, A universal Turing machine with two internal states, Automata Studies, Ann. of Math. Stud. 34 (1956) 157-165.
Michael Somos, Busy Beaver
Eric Weisstein's World of Mathematics, Busy Beaver
Wikipedia, Busy beaver
CROSSREFS
Sequence in context: A203295 A318566 A083558 * A026650 A347948 A364328
KEYWORD
hard,nice,nonn,more,changed
AUTHOR
Jud McCranie and N. J. A. Sloane, May 02 2001
EXTENSIONS
Additional references from Bill Dubuque (wgd(AT)martigny.ai.mit.edu)
Edited by N. J. A. Sloane, Aug 30 2011
Additional links from Robert C. Lyons, Jun 22 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 3 19:50 EST 2024. Contains 370512 sequences. (Running on oeis4.)