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: 91,423

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

Analytics

Added to PP
2010-12-22

Downloads
47 (#332,683)

6 months
7 (#416,569)

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