Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.03320DBLPconf/cie/2006OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898826

Lars Kristiansen

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

zbMATH Keywords

typesComplexity theory\(\lambda\)-calculiGödel's \(T\)subrecursive classes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Recursion in Higher Types and Resource Bounded Turing Machines ⋮ A domain model characterising strong normalisation ⋮ A Refinement of the μ-measure for Stack Programs ⋮ Non-determinism in Gödel's system \(T\) ⋮ Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)

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