scientific article
From MaRDI portal
zbMath0501.03025MaRDI QIDQ3966120
Christoph Kreitz, Weihrauch, Klaus
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitycontinuityhierarchyspeedupeffective numberingcomputable real numberscomputable real functionsOracle-Turing-machines
Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
The Hausdorff-Ershov hierarchy in Euclidean spaces, Approximation to measurable functions and its relation to probabilistic computation, On the weak computability of a four dimensional orthogonal packing and time scheduling problem, Hierarchies of function classes defined by the first-value operator, On the time complexity of partial real functions, On the complexity of online computations of real functions, Curves that must be retraced, Type 2 computational complexity of functions on Cantor's space, Multi-Resolution Cellular Automata for Real Computation, On approximate and algebraic computability over the real numbers, Computability structure of the Sobolev spaces and its applications, Computability of Real Numbers, Theory of representations
