Uncomputability and arithmetic

Abstract

Explain how to represent claims about Turing machines (for example, claims of the form ”machine m halts on input i”) in the above language. The goal is a mechanical method for translating claims about TMs into arithmetical claims in a way that preserves truth value.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

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

Through your library

  • Only published works are available at libraries.

Similar books and articles

Knowledge of arithmetic.C. S. Jenkins - 2005 - British Journal for the Philosophy of Science 56 (4):727-747.
Is the human mind a Turing machine?D. King - 1996 - Synthese 108 (3):379-89.
Expressivism About Making and Truth-Making.Stephen Barker - 2012 - In Fabrice Correia & Benjamin Schnieder (eds.), Metaphysical Grounding: Understanding the Structure of Reality. Cambridge: Cambridge University Press. pp. 272-293.
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
Assessment context-sensitive logical claims.Paul L. Simard Smith - 2020 - Inquiry: An Interdisciplinary Journal of Philosophy 63 (3-4):282-301.
What if? Modality and history.Johannes Bulhof - 1999 - History and Theory 38 (2):145–168.
Moral Naturalism and the Normative Question.Susan Babbitt - 2000 - Canadian Journal of Philosophy 30 (sup1):139-173.
General Dynamic Triviality Theorems.Jeffrey Sanford Russell & John Hawthorne - 2016 - Philosophical Review 125 (3):307-339.
Moral Naturalism and the Normative Question.Susan E. Babbitt - 2000 - Canadian Journal of Philosophy, Supplementary Volume 26:139-173.

Analytics

Added to PP
2010-12-22

Downloads
47 (#348,023)

6 months
4 (#863,607)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references