Real Analytic Machines and Degrees
Tobias Gärtner, Martin Ziegler
Electronic Proceedings in Theoretical Computer Science · 2010
doi:10.4204/eptcs.24.12 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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).
Abstract licence: CC BY-NC-ND
References21
21 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.