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)
DOI 10.1023/A:1021180801870
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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 25,727
Through your library
References found in this work BETA

Add more references

Citations of this work BETA
On the Plurality of Gods.Eric Steinhart - 2013 - Religious Studies 49 (3):289-312.
Cofinally Invariant Sequences and Revision.Edoardo Rivello - 2015 - Studia Logica 103 (3):599-622.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

50 ( #99,842 of 2,146,491 )

Recent downloads (6 months)

4 ( #185,113 of 2,146,491 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums