Busy Beaver Machines的评论
Recombinations of Busy Beaver Machines
摘要：
许多程序员认为基于图灵的机器无法思考。我们也相信这一点，但有趣的是，最复杂的机器不是由人类编程的。我们只是发现了他们。在本文中，使用著名的忙碌的海狸和平静的鸭嘴兽机，我们进一步生成非常相似，但不完全相同的机器。我们找到了一台重组的BB_5机器，它可以在停止前走70.740.809步。
英文摘要：
Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that the most sophisticated machines are not programmed by human beings. We have only discovered them. In this paper, using well-known Busy Beaver and Placid Platypus machines, we generate further very similar, but not exactly the same machines. We have found a recombinated BB_5 machine which can make 70.740.809 steps before halting.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
