"Turing's\ oracle": from absolute to relative computability and back

In Javier Echeverria, Andoni Ibarra & Thomas Mormann (eds.), The Space of Mathematics: Philosophical, Epistemological, and Historical Explorations. De Gruyter. pp. 314--348 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Computation and hypercomputation.Mike Stannett - 2003 - Minds and Machines 13 (1):115-153.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Godel on computability.W. Sieg - 2006 - Philosophia Mathematica 14 (2):189-207.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.

Analytics

Added to PP
2014-02-01

Downloads
3 (#1,644,941)

6 months
1 (#1,444,594)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.
A brief critique of pure hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.

Add more citations

References found in this work

No references found.

Add more references