Plottable Real Number Functions and the Computable Graph Theorem

DOI10.1137/060658023MaRDI QIDQ3614160zbMATH OpenOpenAlexFDO

Authors Vasco Brattka

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

zbMATH Keywords

computable analysiseffective local connectivityeffective pathwise connectivitygraph theoremlocal computability

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Constructive and recursive analysis (03F60)

Recommendations

• Effectively closed sets and graphs of computable real functions.
• scientific article; zbMATH DE number 1222103
• A tutorial on computable analysis
• scientific article; zbMATH DE number 1088270
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions

Cited in

(35)

• Semicomputable manifolds in computable topological spaces
• Warsaw discs and semicomputability
• Computability of products of chainable continua
• Computability of pseudo-cubes
• Computable subcontinua of semicomputable chainable Hausdorff continua
• Chainable and circularly chainable semicomputable sets in computable topological spaces
• Computing boundary extensions of conformal maps
• A computability challenge: asymptotic bounds for error-correcting codes
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• scientific article; zbMATH DE number 1263363 (Why is no real title available?)
• Closed choice and a uniform low basis theorem
• Seven kinds of computable and constructive infelicities in economics
• The power of backtracking and the confinement of length
• Computing links and accessing arcs
• Computability of the metric projection onto finite-dimensional linear subspaces
• Computability of Subsets of Metric Spaces
• Computable neighbourhoods of points in semicomputable manifolds
• Computability of graphs
• Connected choice and the Brouwer fixed point theorem
• Approximating functions and measuring distance on a graph
• On the topological aspects of the theory of represented spaces
• Computable Stone spaces
• Computable approximations of a chainable continuum with a computable endpoint
• COMPUTABLY COMPACT METRIC SPACES
• Computability of finite-dimensional linear subspaces and best approximation
• Algorithmic economics: incomputability, undecidability and unsolvability in economics
• Computable type of certain quotient spaces
• Effective versions of local connectivity properties
• An effective Carathéodory theorem
• Computing space-filling curves
• Computability of chainable graphs
• Co-c.e. sets with disconnected complements
• Computable type and computably categorical spaces
• Effective subsets under homeomorphisms of \(\mathbb{R}^n\)

This page was built for publication: Plottable Real Number Functions and the Computable Graph Theorem

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