Real Analytic Machines and Degrees

Tobias Gärtner
(Universität des Saarlandes, Saarbrücken, GERMANY)
Martin Ziegler
(Technische Universität Darmstadt, GERMANY)

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).

In Xizhong Zheng and Ning Zhong: Proceedings Seventh International Conference on Computability and Complexity in Analysis (CCA 2010), Zhenjiang, China, 21-25th June 2010, Electronic Proceedings in Theoretical Computer Science 24, pp. 77–91.
Published: 3rd June 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.24.12 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org