Computability on Regular Subsets of Euclidean Space

DOI10.1002/1521-3870(200210)48:1+%3C157::AID-MALQ157%3E3.0.CO;2-4MaRDI QIDQ4787864zbMATH OpenOpenAlexFDO

Authors Martin Ziegler

Publication date 6 October 2003

Full work available at URL https://doi.org/10.1002/1521-3870(200210)48:1+%3C157::aid-malq157%3E3.0.co;2-4

zbMATH Keywords

computability of subsets of real numbersconvex setsrecursive analysisregular sets

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Elementary problems in Euclidean geometries (51M04) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Computability of sets in Euclidean space
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability of co-regular subsets on metric spaces
• Computability of Subsets of Metric Spaces
• Computability on subsets of metric spaces.
• Computability on Subsets of Locally Compact Spaces
• Computability on computable metric spaces
• scientific article; zbMATH DE number 1222111
• Computability of convex sets
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space

Cited in

(21)

• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability and Beltrami fields in Euclidean space
• Decidability in analysis
• Computable operators on regular sets
• Computability of convex sets
• 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
• Computability of Subsets of Metric Spaces
• Semicomputable points in Euclidean spaces
• Computable operators on co-regular subsets
• Computably Isometric Spaces
• Computability on Subsets of Locally Compact Spaces
• Representations of co-regular subsets on Euclidean spaces
• Computability of sets in Euclidean space
• Three concepts of decidability for general subsets of uncountable spaces
• Stability versus speed in a computable algebraic model
• Effectively open real functions

This page was built for publication: Computability on Regular Subsets of Euclidean Space

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