Effectiveness for embedded spheres and balls

DOI10.1016/S1571-0661(04)80384-0MaRDI QIDQ4916189zbMATH OpenFDO

Authors Joseph S. Miller

Publication date 19 April 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(04)80384-0

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78) Constructive and recursive analysis (03F60)

Recommendations

• Co-c.e. spheres and cells in computable metric spaces
• Computability of pseudo-cubes
• scientific article; zbMATH DE number 1746047
• Effective subsets under homeomorphisms of \(\mathbb{R}^n\)
• Computability on subsets of Euclidean space. I: Closed and compact subsets

Cites work

• scientific article; zbMATH DE number 3127537 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3329922 (Why is no real title available?)
• Index sets in computable analysis

Cited in

(31)

• Semicomputable manifolds in computable topological spaces
• Warsaw discs and semicomputability
• Computability of products of chainable continua
• Effective compactness and orbits of points under the isometry group
• Computability of pseudo-cubes
• Computable subcontinua of semicomputable chainable Hausdorff continua
• Chainable and circularly chainable semicomputable sets in computable topological spaces
• Precise smoothing effect in the exterior of balls
• Computing links and accessing arcs
• scientific article; zbMATH DE number 7376056 (Why is no real title available?)
• Computability of Subsets of Metric Spaces
• Computable complex analysis
• Computable neighbourhoods of points in semicomputable manifolds
• Computability of graphs
• On the topological aspects of the theory of represented spaces
• Strong computable type
• Computable approximations of a chainable continuum with a computable endpoint
• The surjection property and computable type
• Comparing computability in two topologies
• Computable subcontinua of circularly chainable continua
• Computable type of certain quotient spaces
• A non-computable c.e. closed subset of \([0, 1]\)
• Effective versions of local connectivity properties
• An effective Carathéodory theorem
• Computing space-filling curves
• Descriptive complexity of topological invariants
• Computability of chainable graphs
• Co-c.e. sets with disconnected complements
• Computable approximations of semicomputable graphs
• Computable type and computably categorical spaces
• Minimality and computability of languages of G-shifts

This page was built for publication: Effectiveness for embedded spheres and balls

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