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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,248

External links

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

Through your library

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.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Implicit and Explicit Examples of the Phenomenon of Deviant Encodings.Paula Quinon - 2020 - Studies in Logic, Grammar and Rhetoric 63 (1):53-67.
Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Philosophical Conceptual Analysis as an Experimental Method.Michael T. Stuart - 2015 - In Thomas Gamerschlag, Doris Gerland, Rainer Osswald & Wiebke Petersen, Meaning, Frames, and Conceptual Representation. Düsseldorf University Press. pp. 267-292.
The proper province of philosophy.Justin Sytsma - 2010 - Review of Philosophy and Psychology 1 (3):427-445.

Analytics

Added to PP
2011-12-08

Downloads
79 (#294,916)

6 months
4 (#1,135,291)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michael Rescorla
University of California, Los Angeles

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