The basic theory of infinite time register machines
From MaRDI portal
Publication:2267751
DOI10.1007/s00153-009-0167-xzbMath1184.03044OpenAlexW2122659273MaRDI QIDQ2267751
Gregor Weckbecker, Peter Koepke, Tim Fischbach, Merlin Carl, Miriam Nasfi, Russell G. Miller
Publication date: 2 March 2010
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-009-0167-x
Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (13)
$$ITRM$$-Recognizability from Random Oracles ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ Discrete Transfinite Computation ⋮ Recognizable sets and Woodin cardinals: computation beyond the constructible universe ⋮ The distribution of ITRM-recognizable reals ⋮ Randomness and degree theory for infinite time register machines1 ⋮ Characterizations of ITBM-computability. I ⋮ OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES ⋮ A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0 ⋮ Taming Koepke's zoo. II: Register machines ⋮ Lower bounds on \(\beta (\alpha)\) ⋮ Clockability for ordinal Turing machines ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines
Cites Work
- Register computations on ordinals
- Ordinal machines and admissible recursion theory
- Minimality considerations for ordinal computers modeling constructibility
- Turing Computations On Ordinals
- An Enhanced Theory of Infinite Time Register Machines
- Infinite time Turing machines
- Post’s Problem for Ordinal Register Machines
- The Complexity of Quickly ORM-Decidable Sets
- The fine structure of the constructible hierarchy
- Logical Approaches to Computational Barriers
This page was built for publication: The basic theory of infinite time register machines
