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 metadatas

Cited literature [60 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00396880
Contributor : Pascal Michel <>
Submitted on : Wednesday, July 12, 2017 - 10:46:55 AM
Last modification on : Friday, January 4, 2019 - 5:32:32 PM
Long-term archiving on : Wednesday, January 24, 2018 - 9:38:40 PM

Files

tpm335.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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

Share

Metrics

Record views

308

Files downloads

1241