The Complexity of Quickly ORM-Decidable Sets
From MaRDI portal
Publication:5425351
DOI10.1007/978-3-540-73001-9_51zbMath1150.03321OpenAlexW1930408770MaRDI QIDQ5425351
David Linetsky, Joel David Hamkins, Russell G. Miller
Publication date: 13 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_51
complexitycomputabilityarithmetical hierarchyregister machinehyperarithmetical hierarchyordinal computationinfinite time computation
Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
Related Items
An Enhanced Theory of Infinite Time Register Machines ⋮ The basic theory of infinite time register machines