The basic theory of infinite time register machines

DOI10.1007/S00153-009-0167-XMaRDI QIDQ2267751zbMATH OpenOpenAlexFDO

Authors Merlin Carl, Tim Fischbach, Peter Koepke, Miriam Nasfi, Gregor Weckbecker, Russell 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

zbMATH Keywords

register machinehypercomputationinfinitary computationordinal computability

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Turing machines and related notions (03D10)

Recommendations

• An Enhanced Theory of Infinite Time Register Machines
• Logical Approaches to Computational Barriers
• A Survey of Infinite Time Turing Machines
• Optimal results on recognizability for infinite time register machines
• Infinite time Turing machines
• scientific article; zbMATH DE number 1909830
• Randomness and degree theory for infinite time register machines
• Towards a theory of infinite time Blum-Shub-Smale machines
• On fixpoint arithmetic and infinite time Turing machines
• Algorithmic randomness for infinite time register machines

Cites work

• An Enhanced Theory of Infinite Time Register Machines
• Infinite time Turing machines
• Logical Approaches to Computational Barriers
• Minimality considerations for ordinal computers modeling constructibility
• Ordinal machines and admissible recursion theory
• Post’s Problem for Ordinal Register Machines
• Register computations on ordinals
• The Complexity of Quickly ORM-Decidable Sets
• The fine structure of the constructible hierarchy
• Turing Computations On Ordinals

Cited in

(20)

• All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• Logical Approaches to Computational Barriers
• Recognizable sets and Woodin cardinals: computation beyond the constructible universe
• The lost melody theorem for infinite time Blum-Shub-Smale machines
• A generalised dynamical system, infinite time register machines, and \(\Pi^1_1\)-\(\mathrm{CA}_{0}\)
• Lower bounds on \(\beta (\alpha)\)
• An Enhanced Theory of Infinite Time Register Machines
• Algorithmic randomness for infinite time register machines
• The lost melody phenomenon
• ITRM-recognizability from random oracles
• Characterizations of ITBM-computability. I
• The distribution of ITRM-recognizable reals
• Randomness and degree theory for infinite time register machines
• ITTMs with feedback
• Infinite time Turing machines with only one tape
• Clockability for ordinal Turing machines
• Taming Koepke's zoo. II: Register machines
• Optimal results on recognizability for infinite time register machines
• Admissibles in gaps

This page was built for publication: The basic theory of infinite time register machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267751)