The busy beaver problem is to find the maximum number of 1's that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this value is to determine whether or not a given n-state Turing machine halts. Whilst this is undecidable in general, it is known to be decidable for n ≤ 3, and undecidable for n ≥ 19. In particular, the decidability question is still open for n = 4 and n = 5. In this paper we discuss our evaluation techniques for busy beaver machines based on induction methods to show the non-termination of particular classes of machines. These are centred around the generation of inductive conjectures about the execution of the machine and the evaluation of these conjectures on a particular evaluation engine. Unlike previous approaches, our aim is not limited to reducing the search space to a size that can be checked by hand; we wish to eliminate hand analysis entirely, if possible, and tominimise it where we cannot. We describe our experiments for the n = 4 and n = 5 cases appropriate inductive conjectures.
繁忙的海狸问题是找到特定类型的 n I>状态图灵机可以打印的最大1。评估此值的关键步骤是确定给定的 n I>状态图灵机是否停止。虽然通常无法确定,但已知对于 n I>≤3是可确定的,对于 n I>≥19是不可确定的。特别是,对于< I> n I> = 4和 n I> =5。在本文中,我们讨论了基于归纳法的繁忙海狸机器评估技术,以显示特定类别机器的非终止性。这些围绕着关于机器执行的归纳猜想的产生以及在特定评估引擎上对这些猜想的评估为中心。与以前的方法不同,我们的目标不限于将搜索空间缩小到可以手动检查的大小;我们希望在可能的情况下完全消除手工分析,并在无法做到的地方将其最小化。我们描述了针对 n I> = 4和 n I> = 5种情况的适当归纳猜想的实验。 P>
机译:繁忙的海狸机器和观察到的水獭试探法(或如何驯服可怕的龙)
机译:小型图灵机和广义繁忙的海狸竞赛
机译:包含空间谐波的感应电机的建模与分析,第三部分:三相笼式转子感应电机
机译:使用有限元方法,负载条件下的感应机中的振动模式证明
机译:对铝和铜转子感应电机中的交流传导效应进行建模和分析,并为分布式风力发电开发新颖的电压调节方案。
机译:使用人工主动脉瓣设计使用机器学习的概念研究证明:从传单设计到压力分析
机译:繁忙海狸的上限证明长度