Infinite time Turing machines

Minds and Machines 12 (4):567-604 (2002)
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: 28,777
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
The Physical Church-Turing Thesis: Modest or Bold?G. Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.

View all 12 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

48 ( #109,933 of 2,177,974 )

Recent downloads (6 months)

2 ( #166,489 of 2,177,974 )

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