Resource-bounded continuity and sequentiality for type-two functionals
ACM Transactions on Computational Logic (TOCL)
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
Resource-Bounded Continuity and Sequentiality for Type-Two Functionals
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Theories with self-application and computational complexity
Information and Computation
Full abstraction, totality and PCF
Mathematical Structures in Computer Science
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Some applications of logic to feasibility in higher types
ACM Transactions on Computational Logic (TOCL)
A proof-theoretic characterization of the basic feasible functionals
Theoretical Computer Science
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The basic feasible functionals in computable analysis
Journal of Complexity
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Speed-Up Theorems in Type-2 Computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Feasible Iteration of Feasible Learning Functionals
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Complexity theory for operators in analysis
Proceedings of the forty-second ACM symposium on Theory of computing
Feasible functions over co-inductive data
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Axiomatizing resource bounds for measure
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Modular code-based cryptographic verification
Proceedings of the 18th ACM conference on Computer and communications security
Complexity and intensionality in a type-1 framework for computable analysis
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Complexity Theory for Operators in Analysis
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
K. Mehlhorn introduced a class of polynomial-time-computable operators in order to study poly-time reducibilities between functions. This class is defined using a generalization of A. Cobham's definition of feasibility for type-1 functions to type-2 functionals. Cobham's feasible functions are equivalent to the familiar poly-time functions. We generalize this equivalence to type-2 functionals. This requires a definition of the notion "poly time in the length of type-1 inputs." The proof of this equivalence is not a simple generalization of the proof for type-1 functions; it depends on the fact that Mehlhorn's class is closed under a strong form of simultaneous limited recursion on notation and requires an analysis of the structure of oracle queries in time-bounded computations.