Relative computability and uniform continuity of relations

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 325
  • Download : 0
We are thus led to a concept of uniform continuity based on the Henkin quantifer and prove it necessary for relative computability of compact real relations. In fact iterating this condition yields a strict hierarchy of notions each necessary—and w-the level also sufficient— for relative computability. A refined, quantitative analysis exhibits a similar topological characterization of relative polynomialtime computability.
Publisher
Association for Symbolic Logic
Issue Date
2013
Language
English
Citation

Journal of Logic and Analysis, v.5, no.7, pp.1 - 39

ISSN
1759-9008
DOI
10.4115/jla.2013.5.7
URI
http://hdl.handle.net/10203/203389
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0