Characterizing complexity classes by general recursive definitions in higher types
- 9 June 2005
- book chapter
- Published by Springer Nature
- p. 99-117
- https://doi.org/10.1007/bfb0026297
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Expressibility as a Complexity Measure: Results and DirectionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Characterization of Complexity Classes in Higher-Order LogicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Necessary and sufficient conditions for the universality of programming formalismsActa Informatica, 1985
- Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion TheoryPublished by Elsevier ,1985
- Algebras of feasible functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983