Infinite Time Turing Machines

Author: Hamkins J.D.

Source: Minds and Machines, Volume 12, Number 4, November 2002 , pp. 521-539(19)

Publisher: Springer

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: infinite time; jump theorem; Post's problem; supertask; Turing degrees; Turing machine

Language: English

Document Type: Research article

Affiliations: 1: The City University of New York, New York, USA; E-mail: jdh@hamkins.org

Publication date: 2002-11-01

• In this: publication
• By this: publisher
• In this Subject: Computer Science
• By this author: Hamkins J.D.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers