The Length of Infinite Time Turing Machine Computations
From MaRDI portal
Publication:4487651
DOI10.1112/S0024609399006657zbMath1016.03040MaRDI QIDQ4487651
No author found.
Publication date: 22 June 2000
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0024609399006657
03E45: Inner models, including constructibility, ordinal definability, and core models
03D10: Turing machines and related notions
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY, Unnamed Item, Measure-theoretic uniformity and the Suslin functional, GENERICITY AND RANDOMNESS WITH ITTMS, Guest editors' introduction, Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems, Infinite time extensions of Kleene's \({\mathcal O}\), Post's problem for ordinal register machines: an explicit approach, Admissibles in gaps, Infinite time busy beavers, Decision times of infinite computations, The computational strengths of \(\alpha\)-tape infinite time Turing machines, Bounding lemmata for non-deterministic halting times of transfinite Turing machines, Weak systems of determinacy and arithmetical quasi-inductive definitions, Determinacy in strong cardinal models