无限时间图灵机的Busy Beaver问题
A Busy Beaver Problem for Infinite-Time Turing Machines
摘要：
本文将经典可计算性理论推广到忙碌的海狸问题的无限时间计算的设定，并证明了一些关于相关函数增长率的结果。在我们看来，这些结果表明，推广是自然的和有前途的。
英文摘要：
This note introduces a generalization to the setting of infinite-time computation of the busy beaver problem from classical computability theory, and proves some results concerning the growth rate of an associated function. In our view, these results indicate that the generalization is both natural and promising.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
