Characterizing complexity classes by general recursive definitions in higher types

DOI10.1016/0890-5401(92)90062-KzbMath0773.68032MaRDI QIDQ1207943

Andreas Goerdt

Publication date: 16 May 1993

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

recursive definitionsfinite structuresfirst-order functionsinfinite syntactic hierarchy

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Computational Complexity Via Finite Types ⋮ The Power of Non-determinism in Higher-Order Implicit Complexity ⋮ Implicit computation complexity in higher-order programming languages

Cites Work

• Necessary and sufficient conditions for the universality of programming formalisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing complexity classes by general recursive definitions in higher types