Plottable Real Number Functions and the Computable Graph Theorem
From MaRDI portal
Publication:3614160
DOI10.1137/060658023zbMath1165.03052OpenAlexW2005038809MaRDI QIDQ3614160
Publication date: 16 March 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f16b99e5dfa2d27612d45226881c94683b9305bc
computable analysiseffective local connectivitygraph theoremlocal computabilityeffective pathwise connectivity
Constructive and recursive analysis (03F60) Theory of numerations, effectively presented structures (03D45)
Related Items
A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes ⋮ Computability of pseudo-cubes ⋮ Computable Stone spaces ⋮ Effective subsets under homeomorphisms of \(\mathbb{R}^n\) ⋮ Seven Kinds of Computable and Constructive Infelicities in Economics ⋮ Computable approximations of a chainable continuum with a computable endpoint ⋮ Computability of graphs ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Closed choice and a uniform low basis theorem ⋮ Semicomputable manifolds in computable topological spaces ⋮ Computability of finite-dimensional linear subspaces and best approximation ⋮ Warsaw discs and semicomputability ⋮ Computable subcontinua of semicomputable chainable Hausdorff continua ⋮ The power of backtracking and the confinement of length ⋮ Computable neighbourhoods of points in semicomputable manifolds ⋮ Computing links and accessing arcs ⋮ Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces ⋮ 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 ⋮ Weihrauch degrees, omniscience principles and weak computability ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computing boundary extensions of conformal maps ⋮ Computability of Subsets of Metric Spaces
