REAL ANALYTIC MACHINES AND DEGREES: A TOPOLOGICAL VIEW ON ALGEBRAIC LIMITING COMPUTATION
We study and compare in 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 real computation: BSS machines (aka real-RAM) and strongly/weakly analytic machines as introduced by Hotz et al. (1995).
- Publisher
- TECH UNIV BRAUNSCHWEIG
- Issue Date
- 2011
- Language
- English
- Article Type
- Article
- Citation
LOGICAL METHODS IN COMPUTER SCIENCE, v.7, no.3
- ISSN
- 1860-5974
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 1 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.