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.03062OpenAlexW2025592951MaRDI 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
Constructive and recursive analysis (03F60) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Elementary problems in Euclidean geometries (51M04)
Related Items (12)
Effectively open real functions ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ 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 ⋮ Decidability in analysis ⋮ Computability of Subsets of Metric Spaces ⋮ Three concepts of decidability for general subsets of uncountable spaces ⋮ Stability versus speed in a computable algebraic model
This page was built for publication: Computability on Regular Subsets of Euclidean Space