Infinite time Turing machines

Journal of Symbolic Logic 65 (2):567-604 (2000)
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)
DOI 10.1023/A:1021180801870
 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: 15,865
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.

Add more references

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

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

31 ( #101,145 of 1,725,153 )

Recent downloads (6 months)

5 ( #134,554 of 1,725,153 )

How can I increase my downloads?

My notes
Sign in to use this feature

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