scientific article; zbMATH DE number 2013199

zbMATH Open1027.03513MaRDI QIDQ4436366FDOQ4436366

Klaus Weihrauch

Publication date: 4 December 2003

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1107625
• Computability in analysis
• scientific article; zbMATH DE number 1101599
• scientific article; zbMATH DE number 1460545
• A simple and powerful approach for studying constructivity, computability, and complexity

zbMATH Keywords

computational complexitycomputable analysiscomputability theorytype 2 theory of effectivity

Mathematics Subject Classification ID

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

Cited In (27)

• Absolutely non-computable predicates and functions in analysis
• An extension of chaotic probability models to real-valued variables
• Computability of measurable sets via effective topologies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability on computable metric spaces
• Representations of the real numbers and of the open subsets of the set of real numbers
• Online computations of differentiable functions
• Computability on the probability measures on the Borel sets of the unit interval
• A refined model of computation for continuous problems
• Constructive mathematics: a foundation for computable analysis
• Elementary computable topology
• Spaces allowing Type‐2 Complexity Theory revisited
• Title not available (Why is that?)
• Index sets in computable analysis
• Analytic machines
• On the computability of Walsh functions.
• New Computational Paradigms
• Computability on the probability measures on the Borel sets of the unit interval
• The computable multi-functions on multi-represented sets are closed under programming
• Fast online multiplication of real numbers
• Computability of Self-Similar Sets
• Title not available (Why is that?)
• A Real Number Structure that is Effectively Categorical
• Extended admissibility.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436366)