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.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,351
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries
    References found in this work BETA

    No references found.

    Citations of this work BETA

    No citations found.

    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2010-12-22

    Total downloads

    10 ( #120,276 of 1,088,372 )

    Recent downloads (6 months)

    1 ( #69,449 of 1,088,372 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.