Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.68415OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898830

Benedikt Loewe

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

Mathematics Subject Classification ID

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 (4)

Space-bounded OTMs and REG ∞ ⋮ Symmetry for transfinite computability ⋮ The computational strengths of \(\alpha\)-tape infinite time Turing machines ⋮ Koepke machines and satisfiability for infinitary propositional languages

This page was built for publication: Logical Approaches to Computational Barriers