An Enhanced Theory of Infinite Time Register Machines

DOI10.1007/978-3-540-69407-6_34zbMath1142.03347OpenAlexW1575123319MaRDI QIDQ3507445

Peter Koepke, Russell G. Miller

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_34

zbMATH Keywords

register machinehypercomputationinfinitary computationordinal computability

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items (9)

$$ITRM$$-Recognizability from Random Oracles ⋮ Discrete Transfinite Computation ⋮ All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines ⋮ The distribution of ITRM-recognizable reals ⋮ Ordinal Computability ⋮ The basic theory of infinite time register machines ⋮ A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0 ⋮ Taming Koepke's zoo. II: Register machines ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines

Cites Work

• Unnamed Item
• Turing Computations On Ordinals
• Infinite time Turing machines
• Post’s Problem for Ordinal Register Machines
• The Complexity of Quickly ORM-Decidable Sets
• Logical Approaches to Computational Barriers

This page was built for publication: An Enhanced Theory of Infinite Time Register Machines