Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
On Effective Procedures for Speeding Up Algorithms
Journal of the ACM (JACM)
An Overview of the Theory of Computational Complexity
Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity of formal translations and speed-up results
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY
RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Implicit Computational Complexity for Higher Type Functionals
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Polynomial and abstract subrecursive classes
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
The computational complexity of program schemata
Journal of Computer and System Sciences
Feasible functions over co-inductive data
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Journal of Computer and System Sciences
| Hi-index | 0.00 |
A programming language for the partial computable functionals is used as the basis for a definition of the computational complexity of functionals (type2 functions). An axiomatic account in the spirit of Blum is then provided. The novel features of this approach are justified by applying it to problems in abstract complexity, specifically operator speed-up, and by using it to define the illusive notion of the polynomial degree of an arbitrary function. New results are obtained for these degrees.