Logical Approaches to Computational Barriers
From MaRDI portal
Publication:5898826
DOI10.1007/11780342zbMath1145.03320WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898826
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
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03D20: Recursive functions and relations, subrecursive hierarchies
03B40: Combinatory logic and lambda calculus
Related Items
A Refinement of the μ-measure for Stack Programs, Non-determinism in Gödel's system \(T\), A domain model characterising strong normalisation, Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\), Recursion in Higher Types and Resource Bounded Turing Machines