Computability, Notation, and de re Knowledge of Numbers

Philosophies 1 (7) (2022)
  Copy   BIBTEX

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.

Author Profiles

Eric Snyder
Ashoka University
Stewart Shapiro
Ohio State University
Richard Samuels
Ohio State University

Analytics

Added to PP
2022-03-10

Downloads
250 (#57,059)

6 months
84 (#44,234)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?