Copeland and Proudfoot on computability

Studies in History and Philosophy of Science Part A 43 (1):199-202 (2012)
  Copy   BIBTEX

Abstract

Many philosophers contend that Turing’s work provides a conceptual analysis of numerical computability. In (Rescorla, 2007), I dissented. I argued that the problem of deviant notations stymies existing attempts at conceptual analysis. Copeland and Proudfoot respond to my critique. I argue that their putative solution does not succeed. We are still awaiting a genuine conceptual analysis

Categories

Keywords

Reprint years

DOI

10.1016/j.shpsa.2011.11.002

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Deviant encodings and Turing’s analysis of computability.B. Jack Copeland & Diane Proudfoot - 2010 - Studies in History and Philosophy of Science Part A 41 (3):247-252.
Review of Computability: Turing, Gödel, Church, and Beyond. [REVIEW]Andrew Arana - 2015 - Notre Dame Philosophical Reviews 3 (20).
AI’s New Promise: Our Posthuman Future.Diane Proudfoot & Jack Copeland - 2012 - The Philosophers' Magazine 57:73-78.
The Conjunction Fallacy.Jack Copeland & Diane Proudfoot - 2003 - Logique Et Analyse 181:7-12.
Turing, Wittgenstein and the science of the mind.Diane Proudfoot & Jack Copeland - 1994 - Australasian Journal of Philosophy 72:497-519.
Computability: Gödel, Turing, Church, and beyond.B. J. Copeland, C. Posy & O. Shagrir (eds.) - 2013 - MIT Press.
B. Jack Copeland, Carl J. Posy, Oron Shagrir eds. Computability: Turing, Gödel, Church, and Beyond: Books of Essays.[author unknown] - 2014 - Philosophia Mathematica 22 (1):141-141.
'Turing limit'. Some of them (Steinhart, Copeland) represent extensions of Tur-ing's account, whereas others defend alternatives notions of effective computability (Bringsjord and Zenzen, Wells).Carol E. Cleland - 2002 - Minds and Machines 12:157-158.
B. Jack Copeland, Carl J. Posy, and Oron Shagrir, eds, Computability: Turing, Gödel, Church, and Beyond. Cambridge, Mass.: MIT Press, 2013. ISBN 978-0-262-01899-9. Pp. x + 362. [REVIEW]Roy T. Cook - 2014 - Philosophia Mathematica 22 (3):412-413.
Alan Turing in the Stanford Encyclopedia of Philosophy.Andrew Hodges - unknown
Ethical Theory and Mystical Experience: A Response to Professors Proudfoot and Wainwright.Arthur C. Danto - 1976 - Journal of Religious Ethics 4 (1):37 - 46.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
ROTENSTREICH'S Between Past and Present: An Essay on History. [REVIEW]Copeland Copeland - 1958 - Philosophy and Phenomenological Research 19:546.
Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
Even Turing machines can compute uncomputable functions.Jack Copeland - unknown

Analytics

Added to PP
2011-12-08

Downloads
65 (#239,555)

6 months
6 (#417,196)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michael Rescorla
University of California, Los Angeles

Citations of this work

The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.
Implicit and Explicit Examples of the Phenomenon of Deviant Encodings.Paula Quinon - 2020 - Studies in Logic, Grammar and Rhetoric 63 (1):53-67.

View all 7 citations / Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Acceptable notation.Stewart Shapiro - 1982 - Notre Dame Journal of Formal Logic 23 (1):14-20.
Deviant encodings and Turing’s analysis of computability.B. Jack Copeland & Diane Proudfoot - 2010 - Studies in History and Philosophy of Science Part A 41 (3):247-252.

Add more references