Effectiveness for Embedded Spheres and Balls
From MaRDI portal
Publication:4916189
DOI10.1016/S1571-0661(04)80384-0zbMath1261.03167MaRDI QIDQ4916189
Publication date: 19 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Constructive and recursive analysis (03F60) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)
Related Items (20)
Computability of pseudo-cubes ⋮ Strong computable type ⋮ Computable approximations of a chainable continuum with a computable endpoint ⋮ Computability of graphs ⋮ Unnamed Item ⋮ Semicomputable manifolds in computable topological spaces ⋮ Warsaw discs and semicomputability ⋮ Computable subcontinua of semicomputable chainable Hausdorff continua ⋮ Computable neighbourhoods of points in semicomputable manifolds ⋮ Computing links and accessing arcs ⋮ Effective versions of local connectivity properties ⋮ An effective Carathéodory theorem ⋮ Computing space-filling curves ⋮ On the topological aspects of the theory of represented spaces ⋮ Chainable and circularly chainable semicomputable sets in computable topological spaces ⋮ Co-c.e. sets with disconnected complements ⋮ Computability of products of chainable continua ⋮ Effective compactness and orbits of points under the isometry group ⋮ Computability of Subsets of Metric Spaces ⋮ Computable Complex Analysis
Cites Work
This page was built for publication: Effectiveness for Embedded Spheres and Balls