Computability and convergence

Abstract

For most of its history, mathematics was fairly constructive: • Euclidean geometry was based on geometric construction. • Algebra sought explicit solutions to equations. Analysis, probability, etc. were focused on calculations. Nineteenth century developments in analysis challenged this view. A sequence (an) in a metric space is said Cauchy if for every ε > 0, there is an m such that for every n, n ≥ m, d (a n , a n ) < ε

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,674

External links

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

Through your library

  • Only published works are available at libraries.

Similar books and articles

Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Functional properties and convergence in biology.Mark B. Couch - 2005 - Philosophy of Science 72 (5):1041-1051.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.
Constructivism in mathematics: an introduction.A. S. Troelstra - 1988 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.. Edited by D. van Dalen.
On the notion of effectiveness.Stewart Shapiro - 1980 - History and Philosophy of Logic 1 (1-2):209-230.

Analytics

Added to PP
2012-09-05

Downloads
43 (#377,769)

6 months
1 (#1,501,182)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeremy Avigad
Carnegie Mellon University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references