The recognizability strength of infinite time Turing machines with ordinal parameters
From MaRDI portal
Publication:2011653
DOI10.1007/978-3-319-58741-7_20zbMATH Open1436.03219OpenAlexW2612864725MaRDI QIDQ2011653FDOQ2011653
Authors: 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
Recommendations
- Cardinal-recognizing infinite time Turing machines
- Infinite time recognizability from generic oracles and the recognizable jump operator
- Optimal results on recognizability for infinite time register machines
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe
- A Survey of Infinite Time Turing Machines
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Turing machines and related notions (03D10)
Cites Work
- Infinite time Turing machines
- 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
- The lost melody phenomenon
- Optimal results on recognizability for infinite time register machines
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
- Title not available (Why is that?)
- Cardinal-recognizing infinite time Turing machines
Cited In (7)
- Cardinal-recognizing infinite time Turing machines
- Infinite time recognizability from generic oracles and the recognizable jump operator
- Effectivity and reducibility with ordinal Turing machines
- Optimal results on recognizability for infinite time register machines
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe
- Parameter-free uniformisation
- Ordinal machines and admissible recursion theory
This page was built for publication: The recognizability strength of infinite time Turing machines with ordinal parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011653)
