@. Heiner-marxen and J. Buntrock, 5×10 21 This machine was posted on the web (Google groups) on See machine 3 in Marxen's bb-list: http://www.drb.insel.de/~heiner/BB/bb-list and machine k in Marxen's bb-6list: http://www.drb.insel.de/~heiner/BB/bb-6list See study by H See machine o in Marxen's bb-6list in: http, This machine was posted on the web (Google groups) on October 23, 2000.

@. Heiner-marxen and J. Buntrock, 1 × 10 925 and ?(M ) > 6.4 × 10 462 This machine was posted on the web (Google groups) on October 23 See machine q in Marxen's bb-6list in http://www.drb.insel.de/~heiner/BB/bb-6list See study by Marxen in http://www.drb.insel.de/~heiner/BB/simmbL6_q.html See analyses by R. Munafo, the short one in http or the long one in http, 2000.

@. Heiner-marxen and J. Buntrock, and ?(M ) > 1.2 × 10 865 This machine was posted on the web (Google groups) on See machine r in Marxen's bb-6list in http://www.drb.insel.de/~heiner/BB/bb-6list See study by Marxen in http, 2001.

@. Terry and S. Ligocki, 9 × 10 1762 and ?(M ) > 2.5 × 10 881 . See study by H. Marxen in http, 2007.

@. Terry and S. Ligocki, 5 × 10 2879 and ?(M ) > 4.6 × 10 1439 . See study by H. Marxen in http, 2007.

. Note, 0(E0)1000(10) n R(bin(m))0 . . ., where R(bin(m)) is the number m written in binary in reverse order, so that C(n, 4m + 1) = C(n + 1, m), then we have So we have: . . . 0(A0)0 . . . ? (3) C(2) ? (33) C(9) ? (222) C(29) ? (1, 402) C(79) ? (8, 563) C(202) ? (52, 833) C(509) ? (329, p.722

. Brady, launched the busy beaver competition for two-dimensional Turing machines, 1988.

A. M. Ben-amram, B. A. Julstrom, and U. Zwick, A note on busy beavers and other creatures, Mathematical Systems Theory, vol.41, issue.No. 1, pp.375-386, 1996.
DOI : 10.1002/j.1538-7305.1962.tb00480.x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.1297

A. M. Ben-amram and H. Petersen, Improved bounds for functions related to busy beavers Theory of, Computing Systems, vol.35, issue.1, pp.1-11, 2002.

G. S. Boolos, J. P. Burgess, and R. C. Jeffrey, Computability and Logic, 2002.
DOI : 10.1017/cbo9780511804076

A. H. Brady, Solutions to restricted cases of the halting problem Ph, 1964.

A. H. Brady, Solutions of restricted cases of the halting problem used to determine particular values of a non-computable function (abstract) Notices of the, AMS, vol.12, issue.4, pp.476-477, 1965.

A. H. Brady, The conjectured highest scoring machines for Rado's ?(k) for the value k = 4, IEEE Transactions on Electronic Computers, pp.15-802, 1966.

A. H. Brady, The solution to Rado's busy beaver game is now decided for k = 4 (abstract) Notices of the, AMS, vol.22, issue.1, p.25, 1975.

A. H. Brady, The determination of the value of Rado's noncomputable function ?(k) for four-state Turing machines, Mathematics of Computation, vol.40, issue.162, pp.647-665, 1983.

A. H. Brady, The Busy Beaver Game and the Meaning of Life, pp.259-277, 1988.
DOI : 10.1007/978-3-7091-6597-3_9

M. Buro, Ein Beitrag zur Bestimmung von Rados ?(5) oder Wie fängt man fleßige Biber? (Ger- man) [A contribution to the determination of Rado's ?(5), or: How to catch a busy beaver, 1990.

G. Chaitin, Computing the busy beaver function in: Open Problems in Communication and Computation Reprinted in: Information, Randomness and Incompleteness, World Scientifics, pp.108-112, 1987.

A. K. Dewdney, Computer recreations, Scientific American, vol.251, issue.5, 1984.
DOI : 10.1038/scientificamerican0488-118

A. K. Dewdney, Computer recreations, Scientific American, vol.252, issue.3, 1985.
DOI : 10.1038/scientificamerican0488-118

A. K. Dewdney, Computer recreations, Scientific American, vol.252, issue.16, 1985.
DOI : 10.1038/scientificamerican0488-118

M. W. Green, A lower bound RADO's sigma function for binary turing machines, 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, pp.91-94, 1964.
DOI : 10.1109/SWCT.1964.3

J. Harland, Busy beaver machines and the observant otter heuristic in: Proceedings of the 19th Computing: The Australasian Theory Symposium, 2013.

J. Harland, Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons), Theoretical Computer Science, vol.646, 2016.
DOI : 10.1016/j.tcs.2016.07.016
URL : http://arxiv.org/abs/1602.03228

J. Harland, Generating candidate busy beaver machines (or how to build the zany zoo) (available at https://arxiv, 2016.

J. Hertel, Computing the Uncomputable Rado Sigma Function, The Mathematica Journal, vol.11, issue.2, pp.270-283, 2009.
DOI : 10.3888/tmj.11.2-8

B. A. Julstrom, A bound on the shift function in terms of the busy beaver function SIGACT News, pp.100-106, 1992.

B. A. Julstrom, Noncomputability and the busy beaver problem The, UMAP Journal, vol.14, issue.1, pp.39-74, 1993.

R. J. Kopp, The busy beaver problem M, 1981.

R. R. Korfhage, Logic and Algorithms: With applications to the computer and information sciences Wiley, 1966.

G. Lafitte, Busy beavers gone wild, Electronic Proceedings in Theoretical Computer Science, vol.1, pp.123-129, 2008.
DOI : 10.4204/EPTCS.1.12

G. Lafitte and C. Papazian, The fabric of small Turing machines in: Computation and Logic in the Real World, Proceedings of the Third Conference on Computabiliy in Europe, pp.219-227, 2007.

S. Lin, Computer studies of Turing machine problems Ph, 1963.

S. Lin and T. Rado, Computer Studies of Turing Machine Problems, Journal of the ACM, vol.12, issue.2, pp.196-212, 1965.
DOI : 10.1145/321264.321270

J. Ludewig, U. Schult, and F. Wankmüller, Chasing the busy beaver. Notes and observations on a competition to find the 5-state busy beaver Forschungsberichte des Fachbereiches Informatik Nr 159, 1983.

D. S. Lynn, New Results for Rado's Sigma Function for Binary Turing Machines, IEEE Transactions on Computers, vol.21, issue.8, pp.894-896, 1972.
DOI : 10.1109/TC.1972.5009047

R. Machlin and Q. F. Stout, The complex behavior of simple machines Physica D 42, pp.85-98, 1990.

P. Michel, Busy beaver competition and Collatz-like problems, Archive for Mathematical Logic, vol.69, issue.4, pp.351-367, 1993.
DOI : 10.1002/j.1538-7305.1962.tb00480.x

P. Michel, Small Turing machines and generalized busy beaver competition, Theoretical Computer Science, vol.326, issue.1-3, pp.45-56, 2004.
DOI : 10.1016/j.tcs.2004.05.008
URL : http://doi.org/10.1016/j.tcs.2004.05.008

P. Michel, HOMOLOGY OF GROUPS AND THIRD BUSY BEAVER FUNCTION, International Journal of Algebra and Computation, vol.42, issue.06, pp.769-791, 2010.
DOI : 10.1017/CBO9781139644136

P. Michel, Problems in number theory from busy beaver competition Logical Methods, Computer Science, vol.114, issue.2015, pp.1-35, 2015.
DOI : 10.2168/lmcs-11(4:10)2015
URL : http://arxiv.org/abs/1311.1029

A. Nabutovsky and S. Weinberger, Betti numbers of finitely presented groups and very rapidly growing functions Topology, pp.211-223, 2007.
DOI : 10.1016/j.top.2007.02.002
URL : http://doi.org/10.1016/j.top.2007.02.002

A. Oberschelp, K. Schmidt-göttsch, and G. Todt, Castor quadruplorum, Archive for Mathematical Logic, vol.41, issue.1, pp.35-44, 1988.
DOI : 10.1007/978-3-662-01462-2

H. Petersen, Computable lower bounds for busy beaver Turing machines Studies in Computational Intelligence 25, pp.305-319, 2006.

T. Rado, On Non-Computable Functions, Bell System Technical Journal, vol.41, issue.3, pp.877-884, 1962.
DOI : 10.1002/j.1538-7305.1962.tb00480.x

T. Rado, On a simple source for non-computable functions, Proceedings of the Symposium on Mathematical Theory of Automata, pp.75-81, 1962.
DOI : 10.1002/j.1538-7305.1962.tb00480.x

R. I. Soare, Computability and recursion Bulletin of Symbolic Logic 2, pp.284-321, 1996.
DOI : 10.2307/420992
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.9229

R. I. Soare, Computability and Incomputability, Proceedings of the 3rd CiE, pp.705-715, 2007.
DOI : 10.1007/978-3-540-73001-9_75
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.7010

R. I. Soare, Turing oracle machines, online computing, and three displacements in computability theory, Annals of Pure and Applied Logic, vol.160, issue.3, pp.368-399, 2009.
DOI : 10.1016/j.apal.2009.01.008
URL : http://doi.org/10.1016/j.apal.2009.01.008

T. R. Walsh, The busy beaver on a one-way infinite tape SIGACT News, pp.38-43, 1982.

K. Wang and S. Xu, New relation between the shift function and the busy beaver function, Chinese Journal of Advanced Software Research, vol.2, issue.2, pp.192-197, 1995.

B. Weimann, UntersuchungenüberUntersuchungen¨Untersuchungenüber Rado's Sigma-Funktion und eingeschränkte Halteprobleme bei Turingmaschinen (German) [Studies about Rado's Sigma function and limited halting problems of Turing machines] Dissertation, Rheinische Friedrich-Wilhems, 1973.

B. Weimann, K. Casper, and W. Fenzel, Untersuchungen ??ber Haltende Programme f??r Turing-Maschinen mit 2 Zeichen und Bis zu 5 Befehlen, Proceedings 2. Jahrestagung der Gessellschaft für Informatik E. V. (GI), pp.72-82, 1973.
DOI : 10.1007/978-3-642-80732-9_7

R. Yang, L. Ding, and S. Xu, Some better results estimating the shift function in terms of busy beaver function SIGACT News, pp.43-48, 1997.

A. Yedidia and S. Aaronson, A relatively small Turing machine whose behavior is independent of set theory, Complex Systems, vol.25, issue.2016, pp.297-327, 2016.

S. Aaronson, how to write big numbers with few symbols

A. H. Brady, Busy Beaver Competition for machines with 3 states and 3 symbols

G. Georgiev, Skelet): http://skelet.ludost.net/bb (Busy Beaver Competition for machines with 5 states and 2 symbols, and for reversal machines)

J. Harland, definitions of some inverse functions for the busy beaver functions

T. Hutton, https://github.com/GollyGang/ruletablerepository/wiki/ TwoDimensionalTuringMachines (two-dimensional and higher-dimensional Turing machines