The following pages link to (Q4218943):
Displaying 5 items.
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← 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)
- Safe Weak Minimization Revisited (Q3149881) (← links)
