Computability on Regular Subsets of Euclidean Space
From MaRDI portal
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
(20)- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Complexity of operators on compact sets
- Computability of Subsets of Metric Spaces
- Computable operators on regular sets
- On computable metrization
- Computable operators on co-regular subsets
- Decidability in analysis
- Stability versus speed in a computable algebraic model
- Three concepts of decidability for general subsets of uncountable spaces
- Computability and Beltrami fields in Euclidean space
- Representations of co-regular subsets on Euclidean spaces
- Effectivity on continuous functions in topological spaces
- Computably Isometric Spaces
- Effectively open real functions
- A comparison of certain representations of regularly closed sets
- Revising type-2 computation and degrees of discontinuity
- Computability on Subsets of Locally Compact Spaces
- Computability of convex sets
- Computability of sets in Euclidean space
- scientific article; zbMATH DE number 7561692 (Why is no real title available?)
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)