Switch to: Citations

Add references

You must login to add references.
  1. 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.
    Turing’s analysis of computability has recently been challenged; it is claimed that it is circular to analyse the intuitive concept of numerical computability in terms of the Turing machine. This claim threatens the view, canonical in mathematics and cognitive science, that the concept of a systematic procedure or algorithm is to be explicated by reference to the capacities of Turing machines. We defend Turing’s analysis against the challenge of ‘deviant encodings’.Keywords: Systematic procedure; Turing machine; Church–Turing thesis; Deviant encoding; Acceptable encoding; (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Copeland and Proudfoot on computability.Michael Rescorla - 2012 - Studies in History and Philosophy of Science Part A 43 (1):199-202.
    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.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Intentions Revisited.W. V. O. Quine - 1979 - In Peter A. French, Theodore Edward Uehling & Howard K. Wettstein (eds.), Contemporary Perspectives in the Philosophy of Language. University of Minnesota Press. pp. 5-11.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • An “I” for an I: Singular terms, uniqueness, and reference.Stewart Shapiro - 2012 - Review of Symbolic Logic 5 (3):380-415.
    There is an interesting logical/semantic issue with some mathematical languages and theories. In the language of (pure) complex analysis, the two square roots of i’ manage to pick out a unique object? This is perhaps the most prominent example of the phenomenon, but there are some others. The issue is related to matters concerning the use of definite descriptions and singular pronouns, such as donkey anaphora and the problem of indistinguishable participants. Taking a cue from some work in linguistics and (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • What numbers could not be.Paul Benacerraf - 1965 - Philosophical Review 74 (1):47-73.
    Download  
     
    Export citation  
     
    Bookmark   590 citations  
  • (2 other versions)Mathematical truth.Paul Benacerraf - 1973 - Journal of Philosophy 70 (19):661-679.
    Download  
     
    Export citation  
     
    Bookmark   703 citations  
  • The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.
    Turing computation over a non-linguistic domain presupposes a notation for the domain. Accordingly, computability theory studies notations for various non-linguistic domains. It illuminates how different ways of representing a domain support different finite mechanical procedures over that domain. Formal definitions and theorems yield a principled classification of notations based upon their computational properties. To understand computability theory, we must recognize that representation is a key target of mathematical inquiry. We must also recognize that computability theory is an intensional enterprise: it (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • (1 other version)Quantifying in.David Kaplan - 1968 - Synthese 19 (1-2):178-214.
    Download  
     
    Export citation  
     
    Bookmark   383 citations  
  • Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
    Church's thesis asserts that a number-theoretic function is intuitively computable if and only if it is recursive. A related thesis asserts that Turing's work yields a conceptual analysis of the intuitive notion of numerical computability. I endorse Church's thesis, but I argue against the related thesis. I argue that purported conceptual analyses based upon Turing's work involve a subtle but persistent circularity. Turing machines manipulate syntactic entities. To specify which number-theoretic function a Turing machine computes, we must correlate these syntactic (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • A curious inference.George Boolos - 1987 - Journal of Philosophical Logic 16 (1):1 - 12.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Acceptable notation.Stewart Shapiro - 1982 - Notre Dame Journal of Formal Logic 23 (1):14-20.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • (1 other version)Intensions revisited.W. V. Quine - 1977 - Midwest Studies in Philosophy 2 (1):5-11.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • The dependence of computability on numerical notations.Ethan Brauer - 2021 - Synthese 198 (11):10485-10511.
    Which function is computed by a Turing machine will depend on how the symbols it manipulates are interpreted. Further, by invoking bizarre systems of notation it is easy to define Turing machines that compute textbook examples of uncomputable functions, such as the solution to the decision problem for first-order logic. Thus, the distinction between computable and uncomputable functions depends on the system of notation used. This raises the question: which systems of notation are the relevant ones for determining whether a (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Cardinals, Ordinals, and the Prospects for a Fregean Foundation.Eric Snyder, Stewart Shapiro & Richard Samuels - 2018 - Royal Institute of Philosophy Supplement 82:77-107.
    There are multiple formal characterizations of the natural numbers available. Despite being inter-derivable, they plausibly codify different possible applications of the naturals – doing basic arithmetic, counting, and ordering – as well as different philosophical conceptions of those numbers: structuralist, cardinal, and ordinal. Some influential philosophers of mathematics have argued for a non-egalitarian attitude according to which one of those characterizations is ‘more basic’ or ‘more fundamental’ than the others. This paper addresses two related issues. First, we review some of (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations