REAL ANALYTIC MACHINES AND DEGREES: A TOPOLOGICAL VIEW ON ALGEBRAIC LIMITING COMPUTATION

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 309
  • Download : 201
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
DOI
10.2168/LMCS-7(3:11)2011
URI
http://hdl.handle.net/10203/203391
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
91824.pdf(291.15 kB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0