Pages that link to "Item:Q1989320"
From MaRDI portal
The following pages link to Type-two polynomial-time and restricted lookahead (Q1989320):
Displaying 12 items.
- Speed-up theorems in type-2 computations using oracle Turing machines (Q733754) (← links)
- Complexity for type-2 relations (Q922532) (← links)
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- Feasible computability and resource bounded topology (Q1891148) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Quantitative coding and complexity theory of compact metric spaces (Q2106606) (← links)
- (Q4989411) (← links)
- (Q5094117) (← links)
- Polynomial Running Times for Polynomial-Time Oracle Machines (Q5111319) (← links)
- (Q5145334) (redirect page) (← links)
- Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
- On basic feasible functionals and the interpretation method (Q6629518) (← links)