Recursion in Higher Types and Resource Bounded Turing Machines

DOI10.1007/978-3-540-69407-6_37zbMath1142.03359OpenAlexW1779583967MaRDI QIDQ3507448

Lars Kristiansen

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_37

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10) Higher-type and set recursion theory (03D65)

Related Items (1)

Non-determinism in Gödel's system \(T\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity classes and fragments of C
• Characterizing complexity classes by higher type primitive recursive definitions
• Classical recursion theory. Vol. II
• LOGSPACE and PTIME characterized by programming languages
• Neat function algebraic characterizations of LOGSPACE and LINSPACE
• The expressive power of higher-order types or, life without CONS
• Domain-Theoretic Foundations of Functional Programming
• Computer Science Logic
• New Computational Paradigms
• Logical Approaches to Computational Barriers
• Theory and Applications of Models of Computation

This page was built for publication: Recursion in Higher Types and Resource Bounded Turing Machines