The computable multi-functions on multi-represented sets are closed under programming
From MaRDI portal
Recommendations
Cited in
(21)- Computable invariance
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- On approximate and algebraic computability over the real numbers
- An effective Riemann Mapping Theorem
- Online computations of differentiable functions
- Why does information-based complexity use the real number model?
- Recursive characterization of computable real-valued functions and relations
- PCF extended with real numbers
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computability is an Open Problem
- Relative computability and uniform continuity of relations
- Computability on measurable functions
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Effective Riemann mappings of multiply connected domains and Riemann surfaces
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Complexity of blowup problems (extended abstract)
- An effective Tietze-Urysohn theorem for QCB-spaces (extended abstract)
- On the topological aspects of the theory of represented spaces
- Computer Science for Continuous Data
- Computability on random events and variables in a computable probability space
- Necessary and sufficient conditions for the universality of programming formalisms
This page was built for publication: The computable multi-functions on multi-represented sets are closed under programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3518432)
