Keyword

Busy Beaver function

Description: A function in computability theory giving the maximum number of symbols a halting Turing machine can write, subject to a limit on its states.
Wikidata ID: wiki/Q1427965
OpenAlex ID: keywords/busy-beaver-function
1965 · Shen Lin, Tibor Rado · Journal of the ACM · 98
1990 · Heiner Marxen, Jürgen Buntrock · Bulletin of the European Association for Theoretical Computer Science · 64
1987 · Gregory J. Chaitin · Springer eBooks · 47
2016 · Adam Yedidia, Scott Aaronson · Complex Systems · 44
2009 · Michel, Pascal · arXiv (Cornell University) · 28
2020 · Scott Aaronson · ACM SIGACT News · 26
2005 · Selmer Bringsjord, Owen Kellett, et al. · Applied Mathematics and Computation · 18
2025 · The bbchallenge Collaboration, Blanchard, Justin, et al. · arXiv (Cornell University) · 15
2016 · Luís Antunes, Bruno Bauwens, et al. · Theory of Computing Systems · 13
2015 · Nikolay Vereshchagin, Alexander Shen · Springer eBooks · 12
2023 · Guilherme V. Toledo, Yoni Zohar, et al. · Lecture notes in computer science · 10
2012 · Laurent Bienvenu, Alexander Shen · Lecture notes in computer science · 10
1978 · Robert P. Daley · Mathematical logic quarterly · 10
2006 · James Harland · Computing: The Australasian Theory Symposium · 9
2000 · Cristian S. Calude, Helmut Jürgensen, et al. · Springer eBooks · 9
2015 · Pascal Michel · Logical Methods in Computer Science · 8
2002 · A. M. Ben-Amram, H. Petersen · Theory of Computing Systems · 8
1992 · Bryant A. Julstrom · ACM SIGACT News · 7
1982 · Robert P. Daley · Information and Control · 7
2016 · Laurent Bienvenu, Damien Desfontaines, et al. · Logical Methods in Computer Science · 5
2007 · Alexander Nabutovsky, Shmuel Weinberger · Topology · 5
1997 · Ruiguang Yang, Longyun Ding, et al. · ACM SIGACT News · 5
1987 · Gregory J. Chaitin · WORLD SCIENTIFIC eBooks · 5
Works count: 209
Citation count: 614
Year
Topic
Type