Infinite time Turing machines

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

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,998

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
361 (#55,997)

6 months
38 (#98,529)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Joel David Hamkins
Oxford University

Citations of this work

Computation in physical systems.Gualtiero Piccinini - 2010 - Stanford Encyclopedia of Philosophy.
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 19 citations / Add more citations

References found in this work

Tasks and Supertasks.James Thomson - 1954 - Analysis 15 (1):1--13.
A beautiful supertask.Jon Perez Laraudogoitia - 1996 - Mind 105 (417):81-83.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
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.

View all 13 references / Add more references