Philosophia Mathematica 23 (3):338-366 (2015)

Authors
Michael Rescorla
University of California, Los Angeles
Abstract
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 studies entities as represented in certain ways, rather than entities detached from any means of representing them
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/philmat/nkv009
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,342
Through your library

References found in this work BETA

The Language of Thought.Jerry A. Fodor - 1975 - Harvard University Press.
Knowledge and Belief.Jaakko Hintikka - 1962 - Ithaca: Cornell University Press.
Mathematical Truth.Paul Benacerraf - 1973 - Journal of Philosophy 70 (19):661-679.
Putnam’s Paradox.David K. Lewis - 1984 - Australasian Journal of Philosophy 62 (3):221 – 236.

View all 37 references / Add more references

Citations of this work BETA

Syntax, Semantics, and Computer Programs.William J. Rapaport - 2020 - Philosophy and Technology 33 (2):309-321.

View all 7 citations / Add more citations

Similar books and articles

Concrete Digital Computation: What Does It Take for a Physical System to Compute? [REVIEW]Nir Fresco - 2011 - Journal of Logic, Language and Information 20 (4):513-537.
Transcending Turing Computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.
Computation and Hypercomputation.Mike Stannett - 2003 - Minds and Machines 13 (1):115-153.
Uniform Domain Representations of "Lp" -Spaces.Petter K. Køber - 2007 - Mathematical Logic Quarterly 53 (2):180-205.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Simulation, Computation and Dynamics in Economics.K. Vela Velupillai & Stefano Zambelli - 2015 - Journal of Economic Methodology 22 (1):1-27.

Analytics

Added to PP index
2015-04-26

Total views
95 ( #95,940 of 2,326,057 )

Recent downloads (6 months)
9 ( #73,622 of 2,326,057 )

How can I increase my downloads?

Downloads

My notes