scientific article; zbMATH DE number 4179364

MaRDI QIDQ3203014zbMATH OpenFDO

Authors Andreas Goerdt

Publication date 1989

zbMATH Keywords

PSPACEPTIMEEXPTIMEHigher type primitive recursive definitionsGödel's system T

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Higher-type and set recursion theory (03D65)

Recommendations

• Characterizing complexity classes by higher type primitive recursive definitions
• scientific article; zbMATH DE number 19768
• Characterizing complexity classes by general recursive definitions in higher types
• scientific article; zbMATH DE number 4170889
• scientific article; zbMATH DE number 3995649
• The recursion-theoretic structure of complexity classes
• scientific article; zbMATH DE number 2163035
• scientific article; zbMATH DE number 4108743
• Higher type recursion, ramification and polynomial time
• A characterization of the complexity of recursive predicates

Cited in

(7)

• Characterizing complexity classes by general recursive definitions in higher types
• Characterizing complexity classes by higher type primitive recursive definitions
• Hereditarily-finite sets, data bases and polynomial-time computability
• scientific article; zbMATH DE number 4072354 (Why is no real title available?)
• scientific article; zbMATH DE number 4170889 (Why is no real title available?)
• Computing on structures
• Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3203014)