Computational complexity on computable metric spaces
From MaRDI portal
Publication:4798201
DOI10.1002/malq.200310001zbMath1018.03049OpenAlexW2117033549MaRDI QIDQ4798201
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
Metric spaces, metrizability (54E35) Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80) Theory of numerations, effectively presented structures (03D45)
Related Items
Exact real computation of solution operators for linear analytic systems of partial differential equations, Towards Computational Complexity Theory on Advanced Function Spaces in Analysis, Relative computability and uniform continuity of relations, The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma, COMPUTABLY COMPACT METRIC SPACES, Closed choice and a uniform low basis theorem, Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations, Computability of finite-dimensional linear subspaces and best approximation, 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, On the topological aspects of the theory of represented spaces, Analytical properties of resource-bounded real functionals, Weihrauch degrees, omniscience principles and weak computability, Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision, Computational complexity of classical solutions of partial differential equations, Probabilistic computability and choice, Quantitative coding and complexity theory of compact metric spaces, Admissibly Represented Spaces and Qcb-Spaces, Bit-complexity of solving systems of linear evolutionary partial differential equations
