The Length of Infinite Time Turing Machine Computations

DOI10.1112/S0024609399006657zbMath1016.03040OpenAlexW2147090476MaRDI 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

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (15)

Decision times of infinite computations ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ The computational strengths of \(\alpha\)-tape infinite time Turing machines ⋮ Weak systems of determinacy and arithmetical quasi-inductive definitions ⋮ Determinacy in strong cardinal models ⋮ Guest editors' introduction ⋮ Bounding lemmata for non-deterministic halting times of transfinite Turing machines ⋮ Admissibles in gaps ⋮ Infinite time busy beavers ⋮ GENERICITY AND RANDOMNESS WITH ITTMS ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ Unnamed Item ⋮ Infinite time extensions of Kleene's \({\mathcal O}\) ⋮ Post's problem for ordinal register machines: an explicit approach ⋮ Measure-theoretic uniformity and the Suslin functional

This page was built for publication: The Length of Infinite Time Turing Machine Computations