Results 1 
7 of
7
The Length of Infinite Time Turing Machine Computations
 Bulletin of the London Mathematical Society
"... We show that the halting times of infinite time Turing Machines (considered as ordinals coded by sets of integers) are themselves all capable of being halting outputs of such machines. This gives a clarification of the nature of "supertasks" or infinite time computations. The proof furt ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
We show that the halting times of infinite time Turing Machines (considered as ordinals coded by sets of integers) are themselves all capable of being halting outputs of such machines. This gives a clarification of the nature of "supertasks" or infinite time computations. The proof further yields that the class of sets coded by outputs of halting computations coincides with a level of Godel's constructible hierarchy: namely that of L where is the supremum of halting times. A number of other open questions are thereby answered. 1 Introduction: Infinite Time Turing Machines Hamkins and Lewis in [4] give an account of the construction of these machines (first developed by Kidder and Hamkins in 1989) and develop the basic theory of this notion of computability. The reader should refer to this paper for a clear and full account of their basic properties, from which all the results and definitions of this introduction are taken. But to summarise: an infinite time Turing machine has...
Eventually Infinite Time Turing Machine Degrees
"... We characterise explicitly i, the least ordinal not the length of any eventual output of an Infinite Time Turing machine (halting or otherwise); using this the Infinite Time Turing Degrees are considered, and it is shown how the jump operator coincides with the production of mastercodes for the c ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We characterise explicitly i, the least ordinal not the length of any eventual output of an Infinite Time Turing machine (halting or otherwise); using this the Infinite Time Turing Degrees are considered, and it is shown how the jump operator coincides with the production of mastercodes for the constructible hierarchy; further that the natural ordinals associated with the jump operator satisfy a Spector criterion, and correspond to the L i stables. It also implies that the machines devised are "\Sigma 2 Complete" amongst all such other possible machines. It is shown that least upper bounds of an "eventual jump" hierarchy exist on an initial segment. 1 Introduction: Hamkins and Lewis in [4] give a notion of computability degree based on Infinite Time Turing Machines. They define: Definition 1.1 For f; g 2 ! ! write f 1 g /! 9p 2 ! OE g p (0)#f . The right hand side here is to be interpreted in the usual manner for Turing computability, except that computations are allowe...
Characteristics of discrete transfinite time Turing machine models: halting times, stabilization times, and . . .
, 2008
"... ..."
Table of Contents Post’s and other problems of supertasks of higher type ¡ ¡ ¢ £ ¡ ¡ ¡ £ ¡ 1
"... ..."
(Show Context)
Transfinite Machine Models
, 2011
"... In recent years there has emerged the study of discrete computational models which are allowed to act transfinitely. By ‘discrete ’ we mean that the machine models considered are not analogue machines, but compute by means of distinct stages or in units of time. The paradigm of such models is, of co ..."
Abstract
 Add to MetaCart
(Show Context)
In recent years there has emerged the study of discrete computational models which are allowed to act transfinitely. By ‘discrete ’ we mean that the machine models considered are not analogue machines, but compute by means of distinct stages or in units of time. The paradigm of such models is, of course, Turing’s original
Infinitetime Turing machines and Borel reducibility
"... In this document I will outline a couple of recent developments, due to Joel Hamkins, Philip Welch and myself, in the theory of infinitetime Turing machines. These results were obtained with the idea of extending the scope of the study of Borel equivalence relations, an area of descriptive set theo ..."
Abstract
 Add to MetaCart
(Show Context)
In this document I will outline a couple of recent developments, due to Joel Hamkins, Philip Welch and myself, in the theory of infinitetime Turing machines. These results were obtained with the idea of extending the scope of the study of Borel equivalence relations, an area of descriptive set theory. I will introduce the most basic aspects of Borel equivalence relations, and show how infinitetime computation may provide insight into this area. 1 Infinitetime Turing machines We begin by describing a model of transfinite computation called the infinitetime Turing machine (ITTM), invented by Hamkins and Kidder and introduced by Hamkins and Lewis [1]. Like an ordinary Turing machine, an ITTM is a finite state machine with an input tape, an output tape, and a read/write head. The key addition is that when an ITTM reaches a limit ordinal numbered step, the program enters a special limit state, the read/write head is reset to the left, and the value of each cell is set to the limit of the previous values in that cell (or else zero, if the value has flipped unboundedly many times).
Discrete Transfinite Computation
"... We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have longer tapes than the standard model, or that work on ordinals r ..."
Abstract
 Add to MetaCart
(Show Context)
We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have longer tapes than the standard model, or that work on ordinals rather than numbers. We outline the connections between such models and the older theories of recursion in higher types, generalized recursion theory, and recursion on ordinals such as αrecursion. We conclude that, in particular, polynomial time computation on ωstrings is well modelled by several convergent conceptions. 1