scientific article; zbMATH DE number 2013199

zbMath1027.03513MaRDI QIDQ4436366

Weihrauch, Klaus

Publication date: 4 December 2003

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

zbMATH Keywords

computational complexitycomputability theorycomputable analysistype 2 theory of effectivity

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Theory of numerations, effectively presented structures (03D45) Higher-type and set recursion theory (03D65)

Related Items (max. 100)

Computability of measurable sets via effective topologies ⋮ Fast online multiplication of real numbers ⋮ Unnamed Item ⋮ An extension of chaotic probability models to real-valued variables ⋮ A refined model of computation for continuous problems ⋮ Computability on the probability measures on the Borel sets of the unit interval ⋮ Index sets in computable analysis ⋮ Analytic machines ⋮ Online computations of differentiable functions ⋮ Computability on the probability measures on the Borel sets of the unit interval ⋮ Computability of Self-Similar Sets ⋮ On the computability of Walsh functions. ⋮ Extended admissibility. ⋮ A Real Number Structure that is Effectively Categorical

This page was built for publication: