Computational complexity on computable metric spaces

DOI10.1002/MALQ.200310001MaRDI QIDQ4798201zbMATH OpenOpenAlexFDO

Authors Klaus Weihrauch

Publication date 19 March 2003

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310001

zbMATH Keywords

computable metric spacescomputational complexity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60) Metric spaces, metrizability (54E35)

Recommendations

• Bounded time computation on metric spaces and Banach spaces
• Complexity theory of (functions on) compact metric spaces
• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
• scientific article; zbMATH DE number 1222103
• Computability on computable metric spaces

Cited in

(37)

• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
• Oracle and interactive computations, post-Turing thesis and man-machine interactions
• Computational complexity of classical solutions of partial differential equations
• Quantitative coding and complexity theory of compact metric spaces
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Type 2 computational complexity of functions on Cantor's space
• Probabilistic computability and choice
• Analytical properties of resource-bounded real functionals
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• On the Complexity of Metric Dimension
• Relative computability and uniform continuity of relations
• Weihrauch degrees, omniscience principles and weak computability
• Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
• scientific article; zbMATH DE number 17703 (Why is no real title available?)
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Closed choice and a uniform low basis theorem
• Complexity theory of (functions on) compact metric spaces
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Computability of the metric projection onto finite-dimensional linear subspaces
• Complexity of operators on compact sets
• On computable compact operators on Banach spaces
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
• Admissibly Represented Spaces and Qcb-Spaces
• Bounded time computation on metric spaces and Banach spaces
• Complexity theory for spaces of integrable functions
• Borel Complexity of Topological Operations on Computable Metric Spaces
• On the topological aspects of the theory of represented spaces
• A polynomial time computable metric between points sets
• On the complexity of the theory of a computably presented metric structure
• COMPUTABLY COMPACT METRIC SPACES
• Computability of finite-dimensional linear subspaces and best approximation
• Semantics, specification logic, and Hoare logic of exact real computation
• Second-order parameterizations for the complexity theory of integrable functions
• Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
• Computably locally compact groups and their closed subgroups
• Multi-representation associated to the numbering of a subbasis and formal inclusion relations
• Exact real computation of solution operators for linear analytic systems of partial differential equations

This page was built for publication: Computational complexity on computable metric spaces

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