Infinite time Turing machines

Journal of Symbolic Logic 65 (2):567-604 (2000)
Abstract
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms.
Keywords Post's problem   Turing degrees   Turing machine   infinite time   jump theorem   supertask
Categories (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
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 12,095
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

No references found.

Citations of this work BETA
Eric Steinhart (2013). On the Plurality of Gods. Religious Studies 49 (3):289-312.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

24 ( #76,896 of 1,102,039 )

Recent downloads (6 months)

7 ( #41,676 of 1,102,039 )

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.