Pages that link to "Item:Q2740989"
From MaRDI portal
The following pages link to On characterizations of the basic feasible functionals. I (Q2740989):
Displaying 14 items.
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- On the computational complexity of Longley's \(H\) functional (Q1827400) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Characterizing polynomial time complexity of stream programs using interpretations (Q2346991) (← links)
- Game semantics approach to higher-order complexity (Q2396718) (← links)
- Feasible functionals and intersection of ramified types (Q2842842) (← links)
- Axiomatizing Resource Bounds for Measure (Q3091445) (← links)
- Feasible Iteration of Feasible Learning Functionals (Q3520048) (← links)
- (Q5094117) (← links)
- (Q5141617) (← links)
- On basic feasible functionals and the interpretation method (Q6629518) (← links)