OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES

DOI10.1017/jsl.2015.8zbMath1436.03237OpenAlexW2296203075MaRDI QIDQ2795911

Merlin Carl

Publication date: 22 March 2016

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2015.8

zbMATH Keywords

generalized computabilityinfinite time register machinesinfinite time computabilityrecognizable reals

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) Higher-type and set recursion theory (03D65)

Related Items (5)

$$ITRM$$-Recognizability from Random Oracles ⋮ All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines ⋮ Randomness and degree theory for infinite time register machines1 ⋮ The recognizability strength of infinite time Turing machines with ordinal parameters ⋮ Taming Koepke's zoo. II: Register machines

Cites Work

• Unnamed Item
• Set theory. An introduction to independence proofs
• The basic theory of infinite time register machines
• Ordinal Computability
• A Recursion-Theoretic Characterization of Constructible Reals

This page was built for publication: OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES