Journal of Symbolic Logic 65 (2):567-604 (2000)

Authors
Joel David Hamkins
Oxford University
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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,979
Through your library

References found in this work BETA

Tasks and Supertasks.James Thomson - 1954 - Analysis 15 (1):1--13.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.

Add more references

Citations of this work BETA

The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.

View all 27 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
78 ( #148,157 of 2,505,136 )

Recent downloads (6 months)
1 ( #417,030 of 2,505,136 )

How can I increase my downloads?

Downloads

My notes