Publication:3518432
From MaRDI portal
zbMath1227.03061MaRDI QIDQ3518432
Publication date: 8 August 2008
Full work available at URL: http://www.jucs.org/jucs_14_6/the_computable_multi_functions
realization; computable analysis; flowcharts; type-2 theory of effectivity; multi-functions; TTE; \(\lambda\)-abstraction; multi-representations
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03D75: Abstract and axiomatic computability and recursion theory
Related Items
Complexity of Blowup Problems, An Effective Tietze-Urysohn Theorem for QCB-Spaces, Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra, Computability on random events and variables in a computable probability space, 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
