Cardinal-Recognizing Infinite Time Turing Machines
From MaRDI portal
Publication:5326373
DOI10.1007/978-3-642-39053-1_27zbMath1433.03106arXiv1310.5590OpenAlexW3098257753MaRDI QIDQ5326373
Publication date: 5 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.5590
Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (2)
The recognizability strength of infinite time Turing machines with ordinal parameters ⋮ Weaker variants of infinite time Turing machines
This page was built for publication: Cardinal-Recognizing Infinite Time Turing Machines
