Real Analytic Machines and Degrees: A Topological View on Algebraic Limiting Computation

Real Analytic Machines and Degrees: A Topological View on Algebraic Limiting Computation
复制标题

DOI：
10.2168/lmcs-7(3:11)2011
复制
发表时间：
2010-06
期刊：
Log. Methods Comput. Sci.
影响因子：
--
通讯作者：
Tobias Gärtner;M. Ziegler
Tobias Gärtner;M. Ziegler
中科院分区：
其他
文献类型：
--
作者：
Tobias Gärtner;M. Ziegler

文献摘要

相似文献

我们以两种程度理论的方式（类似于Kleene的算术层次和描述集理论的Borel层次的迭代停机预言机）研究和比较了三种分析计算模型的能力和局限性：BSS机器（又名real-RAM）和由Hotz等人（1995）引入的强/弱分析机器。
We study and compare in two degree-theoretic ways (iterated Halting oracles analogous to Kleene's arithmetical hierarchy and the Borel hierarchy of descriptive set theory) the capabilities and limitations of three models of analytic computation: BSS machines (aka real-RAM) and strongly/weakly analytic machines as introduced by Hotz et. al. (1995).