The basic theory of infinite time register machines
From MaRDI portal
Publication:2267751
DOI10.1007/S00153-009-0167-XzbMATH Open1184.03044OpenAlexW2122659273MaRDI QIDQ2267751FDOQ2267751
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
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
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Turing machines and related notions (03D10)
Cites Work
- The fine structure of the constructible hierarchy
- Infinite time Turing machines
- Ordinal machines and admissible recursion theory
- Turing Computations On Ordinals
- Register computations on ordinals
- Post’s Problem for Ordinal Register Machines
- Logical Approaches to Computational Barriers
- An Enhanced Theory of Infinite Time Register Machines
- Minimality considerations for ordinal computers modeling constructibility
- The Complexity of Quickly ORM-Decidable Sets
Cited In (17)
- The distribution of ITRM-recognizable reals
- A generalised dynamical system, infinite time register machines, and \(\Pi^1_1\)-\(\mathrm{CA}_{0}\)
- An Enhanced Theory of Infinite Time Register Machines
- Clockability for ordinal Turing machines
- Lower bounds on \(\beta (\alpha)\)
- Randomness and degree theory for infinite time register machines1
- The lost melody theorem for infinite time Blum-Shub-Smale machines
- Characterizations of ITBM-computability. I
- Optimal results on recognizability for infinite time register machines
- Discrete transfinite computation models
- Logical Approaches to Computational Barriers
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
- Taming Koepke's zoo. II: Register machines
- ITTMs with feedback
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe
- $$ITRM$$-Recognizability from Random Oracles
- Infinite time Turing machines with only one tape
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)
