arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.4667cs.CC
收藏

通用模拟计算机可以有效地模拟图灵机

Turing machines can be efficiently simulated by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça

摘要:

丘奇-图灵论题指出,任何足够强大的计算模型,只要能抓住算法的概念,在计算上就等同于图灵机。这种等价性通常在可计算性级别和计算复杂性级别模多项式约简都成立。然而,在使用实数的计算模型中,情况不太清楚,并且在这种情况下不存在丘奇-图灵命题的类似物。最近有研究表明,从可计算性的角度来看,某些实数计算模型是等价的。特别是它表明香农的通用模拟计算机(GPAC)是等效的可计算分析。然而,很少有人知道在计算复杂性水平上发生了什么。在本文中,我们揭示了这两个模型之间的连接,从计算复杂性的水平,通过显示,模多项式的减少,计算的图灵机可以模拟的GPAC,而不需要使用更多的(空间)资源比原来的图灵计算中使用的,只要我们谈论的是有界的计算。换句话说,GPAC完成的计算与可计算分析环境中完成的计算一样具有空间效率。

英文摘要:

The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and at a computational complexity level modulo polynomial reductions. However, the situation is less clear in what concerns models of computation using real numbers, and no analog of the Church-Turing thesis exists for this case. Recently it was shown that some models of computation with real numbers were equivalent from a computability perspective. In particular it was shown that Shannon's General Purpose Analog Computer (GPAC) is equivalent to Computable Analysis. However, little is known about what happens at a computational complexity level. In this paper we shed some light on the connections between this two models, from a computational complexity level, by showing that, modulo polynomial reductions, computations of Turing machines can be simulated by GPACs, without the need of using more (space) resources than those used in the original Turing computation, as long as we are talking about bounded computations. In other words, computations done by the GPAC are as space-efficient as computations done in the context of Computable Analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑