Pages that link to "Item:Q424551"
From MaRDI portal
The following pages link to Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551):
Displayed 8 items.
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- Relative computability and uniform continuity of relations (Q2930869) (← links)
- Decomposing Borel functions using the Shore–Slaman join theorem (Q4983474) (← links)
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision (Q4995607) (← links)
- Representations of Analytic Functions and Weihrauch Degrees (Q5740198) (← links)
- Lawvere-Tierney topologies for computability theorists (Q5875936) (← links)