Author:
Friedman Sy-David,Welch P. D.
Abstract
AbstractThe Infinite Time Turing Machine model [8] of Hamkins and Kidder is, in an essential sense, a “Σ2-machine” in that it uses a Σ2Liminf 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 , again generalising precisely the ITTM case.The collection of such machines taken together computes precisely those reals of the least model of analysis.
Publisher
Cambridge University Press (CUP)
Reference17 articles.
1. Welch P. D. , Weak systems of determinacy and arithmetical quasi-inductive definitions, this Journal, (to appear), arXiv:0905.4412.
2. Welch P. D. , Determinacy in strong cardinal models, this Journal, (submitted).
3. Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献