Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

The Busy Beaver Competition: a historical survey

Abstract : Tibor Rado defined the Busy Beaver Competition in 1962. He used Turing machines to give explicit definitions for some functions that are not computable and grow faster than any computable function. He put forward the problem of computing the values of these functions on numbers 1, 2, 3, ... More and more powerful computers have made possible the computation of lower bounds for these values. In 1988, Brady extended the definitions to functions on two variables. We give a historical survey of these works. The successive record holders in the Busy Beaver Competition are displayed, with their discoverers, the date they were found, and, for some of them, an analysis of their behavior.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [87 references]  Display  Hide  Download
Contributor : Pascal Michel Connect in order to contact the contributor
Submitted on : Wednesday, September 4, 2019 - 9:24:34 AM
Last modification on : Friday, March 27, 2020 - 4:05:38 AM
Long-term archiving on: : Wednesday, February 5, 2020 - 5:18:56 PM


Files produced by the author(s)


  • HAL Id : hal-00396880, version 6
  • ARXIV : 0906.3749



Pascal Michel. The Busy Beaver Competition: a historical survey. 2017. ⟨hal-00396880v6⟩



Les métriques sont temporairement indisponibles