Pages that link to "Item:Q864439"
From MaRDI portal
The following pages link to The basic feasible functionals in computable analysis (Q864439):
Displaying 9 items.
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- On the computational complexity of Longley's \(H\) functional (Q1827400) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Analytical properties of resource-bounded real functionals (Q2509953) (← links)
- On characterizations of the basic feasible functionals. I (Q2740989) (← links)
- Representations and evaluation strategies for feasibly approximable functions (Q4995603) (← links)
- Continuous and monotone machines (Q5089226) (← links)
- Polynomial Running Times for Polynomial-Time Oracle Machines (Q5111319) (← links)
- Characterizing polynomial time computability of rational and real functions (Q5146653) (← links)