忙碌的海狸比赛：一个历史的调查
The Busy Beaver Competition: a historical survey
摘要：
Tibor Rado在1962年定义了Busy Beaver Competition。他使用图灵机给一些函数明确的定义，这些函数是不可计算的，并且比任何可计算的函数增长得都快。他提出的问题，计算值的这些职能的数字1，2，3，.越来越强大的计算机使得计算这些值的下界成为可能。1988年，Brady将定义扩展到了二元函数。我们给这些作品的历史调查。在忙碌的海狸比赛中连续的记录保持者都被展示出来，与他们的发现者，他们被发现的日期，并为他们中的一些人，他们的行为分析。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
