Theory and Applications of Models of Computation

DOI10.1007/11750321zbMath1178.68277OpenAlexW4296156427MaRDI QIDQ5898918

Lars Kristiansen, Paul J. Voda

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/11750321

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Higher-type and set recursion theory (03D65)

Related Items (3)

Recursion in Higher Types and Resource Bounded Turing Machines ⋮ 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: Theory and Applications of Models of Computation