scientific article; zbMATH DE number 19768

MaRDI QIDQ3979266zbMATH OpenFDO

Authors Helmut Seidl, Andreas Goerdt

Publication date 26 June 1992

zbMATH Keywords

complexity classfinite structuresGödel's system THigher type primitive recursive definitions

Mathematics Subject Classification ID

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

Recommendations

• Characterizing complexity classes by higher type primitive recursive definitions
• scientific article; zbMATH DE number 4179364
• scientific article; zbMATH DE number 4170889
• Characterizing complexity classes by general recursive definitions in higher types

Cited in

(11)

• Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
• A decidable characterization of the classes between lintime and exptime
• Characterizing complexity classes by higher type primitive recursive definitions
• Characterizing complexity classes by general recursive definitions in higher types
• The \(\mu\)-measure as a tool for classifying computational complexity
• Computational Complexity Via Finite Types
• scientific article; zbMATH DE number 4179364 (Why is no real title available?)
• scientific article; zbMATH DE number 4170889 (Why is no real title available?)
• Recursion in Higher Types and Resource Bounded Turing Machines
• Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
• scientific article; zbMATH DE number 806752 (Why is no real title available?)

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 Q3979266)