论文标题
重置无限时间Blum-Shub-Smale-Machines
Resetting Infinite Time Blum-Shub-Smale-Machines
论文作者
论文摘要
在本文中，我们研究了Seyfferth在[14]中提出的无限时间Blum-Shub-Sale-Machines（ITBMS）和[15]中通过在极限阶段修改机器的行为而获得的。特别是，我们研究了强大的无限时间Blum-Shub-Sale-Machines（SITBMS），这是ITBMS的变化，其中LIM在以极限步骤计算寄存器的内容时可以用LIM INF代替。我们将为此类机器的计算强度提供下限。然后，我们将研究计算较高复杂性的SITBM限制的计算强度。我们将为这些机器的计算强度提供上限，以便我们将在[15]中取得结果，并将对韦尔奇在[15]中提出的问题提供部分答案。
In this paper, we study strengthenings of Infinite Times Blum-Shub-Smale-Machines (ITBMs) that were proposed by Seyfferth in [14] and Welch in [15] obtained by modifying the behaviour of the machines at limit stages. In particular, we study Strong Infinite Times Blum-Shub-Smale-Machines (SITBMs), a variation of ITBMs where lim is substituted by lim inf in computing the content of registers at limit steps. We will provide lower bounds to the computational strength of such machines. Then, we will study the computational strength of restrictions of SITBMs whose computations have low complexity. We will provide an upper bound to the computational strength of these machines, in doing so we will strenghten a result in [15] and we will give a partial answer to a question posed by Welch in [15].
