Infinite Time Turing Machines

Author: Hamkins J.D.1

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

Publisher: Springer

Purchase options

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax      Refund Policy

OR

 
More like this?
Content Key:
Free Content - Free
New Content - New
Open Access Content - Open Access
Subscribed Content - Subscribed
Free Trial Content - Free Trial

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

Back to top

Content Key:
Free Content - Free
New Content - New
Open Access Content - Open Access
Subscribed Content - Subscribed
Free Trial Content - Free Trial
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in
Need to register?
Sign up here
Text size: A | A | A | A