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 ) < ε | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesViggo Stoltenberg-Hansen & John V. Tucker (2003). Computable and Continuous Partial Homomorphisms on Metric Partial Algebras. Bulletin of Symbolic Logic 9 (3):299-334.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Mark B. Couch (2005). Functional Properties and Convergence in Biology. Philosophy of Science 72 (5):1041-1051.
Michael Rescorla (2012). Copeland and Proudfoot on Computability. Studies in History and Philosophy of Science Part A 43 (1):199-202.
Malcolm Parker (2007). Two Into One Won't Go: Conceptual, Clinical, Ethical and Legal Impedimenta to the Convergence of Cam and Orthodox Medicine. Journal of Bioethical Inquiry 4 (1).
Stewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.
Kajsa Bråting (2012). Ambiguities of Fundamental Concepts in Mathematical Analysis During the Mid-Nineteenth Century. Foundations of Science 17 (4):301-320.
Alexandre Borovik & Mikhail G. Katz (2012). Who Gave You the Cauchy–Weierstrass Tale? The Dual History of Rigorous Calculus. Foundations of Science 17 (3):245-276.
George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
A. S. Troelstra (1988). Constructivism in Mathematics: An Introduction. Sole Distributors for the U.S.A. And Canada, Elsevier Science Pub. Co..
Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.
Stewart Shapiro (1980). On the Notion of Effectiveness. History and Philosophy of Logic 1 (1-2):209-230.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2012-09-05Total downloads2 ( #232,575 of 549,122 )Recent downloads (6 months)1 ( #63,361 of 549,122 )How can I increase my downloads? |
My notes
Discussion
