The recognizability strength of infinite time Turing machines with ordinal parameters

DOI10.1007/978-3-319-58741-7_20zbMath1436.03219OpenAlexW2612864725MaRDI QIDQ2011653

Merlin Carl, Philipp Schlicht

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_20

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Infinite time decidable equivalence relation theory
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• Recognizable sets and Woodin cardinals: computation beyond the constructible universe
• The distribution of ITRM-recognizable reals
• OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES
• Infinite time Turing machines
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• The Lost Melody Phenomenon
• Cardinal-Recognizing Infinite Time Turing Machines

This page was built for publication: The recognizability strength of infinite time Turing machines with ordinal parameters