On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis

Annals of Pure and Applied Logic 32:291-297 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,442

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
d-computable Categoricity for Algebraic Fields.Russell Miller - 2009 - Journal of Symbolic Logic 74 (4):1325 - 1351.

Analytics

Added to PP
2014-01-16

Downloads
4 (#1,240,690)

6 months
1 (#454,876)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Some applications of Kleene's methods for intuitionistic systems.Harvey Friedman - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 113--170.
Church's thesis, continuity, and set theory.M. Beeson & A. Ščedrov - 1984 - Journal of Symbolic Logic 49 (2):630-643.
Recursive Metric Spaces.Y. N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (4):651-652.

Add more references