Pages that link to "Item:Q1362334"
From MaRDI portal
The following pages link to Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334):
Displaying 4 items.
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Speed-up theorems in type-2 computations using oracle Turing machines (Q733754) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
