Philosophies 7 (20):20 (2022)

Authors
Stewart Shapiro
Ohio State University
Eric Snyder
Ludwig Maximilians Universität, München
Richard Samuels
Ohio State University
Abstract
Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of _which number_ is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of _notation_. The purpose of this article is to explore the relationship between the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.3390/philosophies7010020
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,410
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Mathematical Truth.Paul Benacerraf - 1973 - Journal of Philosophy 70 (19):661-679.
What Numbers Could Not Be.Paul Benacerraf - 1965 - Philosophical Review 74 (1):47-73.
Quantifying In.David Kaplan - 1968 - Synthese 19 (1-2):178-214.
Intensions Revisited.W. V. Quine - 1977 - Midwest Studies in Philosophy 2 (1):5-11.
The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.

View all 14 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

On the Buck-Stopping Identification of Numbers.Dongwoo Kim - 2021 - Philosophia Mathematica 29 (2):234-255.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
Computability on Regular Subsets of Euclidean Space.Martin Ziegler - 2002 - Mathematical Logic Quarterly 48 (S1):157-181.
Order‐Free Recursion on the Real Numbers.Vasco Brattka - 1997 - Mathematical Logic Quarterly 43 (2):216-234.
Implicit and Explicit Examples of the Phenomenon of Deviant Encodings.Paula Quinon - 2020 - Studies in Logic, Grammar and Rhetoric 63 (1):53-67.
Dictionary of Logical Terms and Symbols.Carol Horn Greenstein - 1978 - New York, NY, USA: Van Nostrand Reinhold Company.
The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.
Remarks on the Development of Computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
On Computable Numbers with an Application to the AlanTuringproblem.C. F. Huws & J. C. Finnis - 2017 - Artificial Intelligence and Law 25 (2):181-203.

Analytics

Added to PP index
2022-04-01

Total views
14 ( #735,344 of 2,519,864 )

Recent downloads (6 months)
14 ( #55,499 of 2,519,864 )

How can I increase my downloads?

Downloads

My notes