Is P = PSPACE for Infinite Time Turing Machines?
From MaRDI portal
Publication:3644798
DOI10.1007/978-3-642-03092-5_10zbMath1258.68064OpenAlexW1486286946MaRDI QIDQ3644798
Publication date: 12 November 2009
Published in: Infinity in Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03092-5_10
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computation over the reals, computable analysis (03D78)
Related Items (2)
Symmetry for transfinite computability ⋮ Koepke machines and satisfiability for infinitary propositional languages
This page was built for publication: Is P = PSPACE for Infinite Time Turing Machines?
