Computability on Regular Subsets of Euclidean Space
From MaRDI portal
Publication:4787864
DOI<157::AID-MALQ157>3.0.CO;2-4 10.1002/1521-3870(200210)48:1+<157::AID-MALQ157>3.0.CO;2-4zbMath1020.03062MaRDI QIDQ4787864
Publication date: 6 October 2003
Full work available at URL: https://doi.org/10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4
03F60: Constructive and recursive analysis
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
51M04: Elementary problems in Euclidean geometries
Related Items
A Comparison of Certain Representations of Regularly Closed Sets, Complexity of Operators on Compact Sets, Effectivity on Continuous Functions in Topological Spaces, Revising Type-2 Computation and Degrees of Discontinuity, On Computable Metrization, Unnamed Item, Computability of Subsets of Metric Spaces, Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy, Three concepts of decidability for general subsets of uncountable spaces, Stability versus speed in a computable algebraic model, Effectively open real functions, Decidability in analysis