The following pages link to (Q3518432):
Displaying 18 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Computability on random events and variables in a computable probability space (Q690479) (← links)
- Computable invariance (Q1274805) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- An effective Riemann Mapping Theorem (Q1292405) (← links)
- Online computations of differentiable functions (Q1292412) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
- PCF extended with real numbers (Q1349926) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Relative computability and uniform continuity of relations (Q2930869) (← links)
- Computability on measurable functions (Q2964280) (← links)
- Effective Riemann mappings of multiply connected domains and Riemann surfaces (Q4593241) (← links)
- Complexity of Blowup Problems (Q4918017) (← links)
- An Effective Tietze-Urysohn Theorem for QCB-Spaces (Q4918018) (← links)
- On the topological aspects of the theory of represented spaces (Q5740207) (← links)
