Minds and Machines 12 (4):567-604 (2002)

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: 68,908
Through your library

References found in this work BETA

Tasks and Supertasks.James Thomson - 1954 - Analysis 15 (1):1--13.
A Beautiful Supertask.Jon Perez Laraudogoitia - 1996 - Mind 105 (417):81-83.
Non-Turing Computers and Non-Turing Computability.Mark Hogarth - 1994 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:126-138.
Infinite Time Turing Machines.Joel Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.

View all 10 references / 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.
Super Turing-Machines.B. Jack Copeland - 1998 - Complexity 4 (1):30-32.
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 18 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
313 ( #32,786 of 2,497,768 )

Recent downloads (6 months)
2 ( #283,405 of 2,497,768 )

How can I increase my downloads?

Downloads

My notes