The following pages link to (Q4010352):
Displaying 26 items.
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Speed-up theorems in type-2 computations using oracle Turing machines (Q733754) (← links)
- On functional complexity and superpositions of functions (Q1071881) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- \({\mathcal M}^\omega\) considered as a programming language (Q1304541) (← links)
- Functions computable with limited access to NP (Q1351162) (← links)
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150) (← links)
- An abstract data type for real numbers (Q1960529) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Type 2 computational complexity of functions on Cantor's space (Q2277260) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- Feasible functionals and intersection of ramified types (Q2842842) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- (Q2996237) (← links)
- Safe Weak Minimization Revisited (Q3149881) (← links)
- (Q3708005) (← links)
- (Q3773880) (← links)
- (Q3816069) (← links)
- Higher order interpretation for higher order complexity (Q4645740) (← links)
- (Q4793030) (← links)
- Computability and the Implicit Function Theorem (Q4921433) (← links)
- (Q5094117) (← links)
