scientific article

zbMath1227.03061MaRDI QIDQ3518432

Weihrauch, Klaus

Publication date: 8 August 2008

Full work available at URL: http://www.jucs.org/jucs_14_6/the_computable_multi_functions

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

realizationcomputable analysisflowchartstype-2 theory of effectivitymulti-functionsTTE\(\lambda\)-abstractionmulti-representations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (19)

Recursive characterization of computable real-valued functions and relations ⋮ PCF extended with real numbers ⋮ Relative computability and uniform continuity of relations ⋮ Effective Riemann mappings of multiply connected domains and Riemann surfaces ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Computability on measurable functions ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Computability on random events and variables in a computable probability space ⋮ Complexity of Blowup Problems ⋮ An Effective Tietze-Urysohn Theorem for QCB-Spaces ⋮ On the topological aspects of the theory of represented spaces ⋮ Computer Science for Continuous Data ⋮ 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?

This page was built for publication: