The Busy Beaver Competition: a historical survey

Details The Busy Beaver Competition: a historical survey The Busy Beaver Competition: a historical survey

2009-06-19

arxiv.org/abs/0906.3749v2

Mathematics

Logic

61 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Busy Beaver Competition: a historical survey does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Busy Beaver Competition: a historical survey, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Busy Beaver Competition: a historical survey will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13181