Skip to main content
Article thumbnail
Location of Repository

HYPERMACHINES SY-DAVID FRIEDMAN,

By P. D. Welch

Abstract

Abstract. The Infinite Time Turing Machine model [8] of Hamkins and Kidder is, in an essential sense, a “Σ2-machine ” in that it uses a Σ2 Liminf Rule to determine cell values at limit stages of time. We give a generalisation of these machines with an appropriate Σn rule. Such machines either halt or enter an infinite loop by stage ζ(n) =df µζ(n)[∃Σ(n)> ζ(n) Lζ(n) ≺Σn LΣ(n)], again generalising precisely the ITTM case. The collection of such machines taken together, computes precisely those reals of the least model of analysis. §1. Introduction. The Infinite Time Turing Machine (ITTM) model described in [8] is an attractive model of transfinite time computation based on the standard Turing machine with an infinite one way tape, and a finite transition table or instruction set. The latter specifies how the machine behaves at successor steps as is usual, and one needs really only to specify precisely how such a machine behaves at limit steps in time t

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.169.3078
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.maths.bris.ac.uk/%7... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.