Koepke machines and satisfiability for infinitary propositional languages
From MaRDI portal
Publication:2011652
DOI10.1007/978-3-319-58741-7_19zbMath1436.03218OpenAlexW2612962042MaRDI QIDQ2011652
Merlin Carl, Benedikt Loewe, Benjamin G. Rin
Publication date: 4 August 2017
Full work available at URL: http://dspace.library.uu.nl/handle/1874/358640
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10)
Related Items (3)
Space-bounded OTMs and REG ∞ ⋮ Symmetry for transfinite computability ⋮ Realisability for infinitary intuitionistic set theory
Cites Work
- Unnamed Item
- Unnamed Item
- Ordinal machines and admissible recursion theory
- \(P\neq NP\) for infinite time Turing machines
- The computational strengths of \(\alpha\)-tape infinite time Turing machines
- Turing Computations On Ordinals
- P ≠ NP ∩ co-NP for Infinite Time Turing Machines
- Ordinal Computability
- Is P = PSPACE for Infinite Time Turing Machines?
- Pf ≠ NPf for almost all f
- Infinite time Turing machines
- Infinite time recognizability from generic oracles and the recognizable jump operator1
- Logical Approaches to Computational Barriers
This page was built for publication: Koepke machines and satisfiability for infinitary propositional languages
