The effective sequence of uniformities and its limit: as a methodology in computable analysis


Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.4288/jafpos1956.15.99
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 45,629
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Limiting Recursion.E. Mark Gold - 1965 - Journal of Symbolic Logic 30 (1):28-48.

Add more references

Citations of this work BETA

Inside the Muchnik Degrees I: Discontinuity, Learnability and Constructivism.K. Higuchi & T. Kihara - 2014 - Annals of Pure and Applied Logic 165 (5):1058-1114.

Add more citations

Similar books and articles

Uncomputably Noisy Ergodic Limits.Jeremy Avigad - 2012 - Notre Dame Journal of Formal Logic 53 (3):347-350.
Computable Metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
Computable Shuffle Sums of Ordinals.Asher M. Kach - 2008 - Archive for Mathematical Logic 47 (3):211-219.
The Unimportance of Being Random.Michael J. White - 1988 - Synthese 76 (1):171 - 178.

Analytics

Added to PP index
2014-03-11

Total views
28 ( #324,447 of 2,280,567 )

Recent downloads (6 months)
6 ( #190,873 of 2,280,567 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature