Conservatively Approximable Functions

DOI10.1007/978-3-642-35722-0_28zbMath1437.03176OpenAlexW181419582MaRDI QIDQ3455861

Sebastian Wyman

Publication date: 11 December 2015

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35722-0_28

zbMATH Keywords

computabilitycomputable analysiseffective symbolic dynamicseffectively closed sets

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Symbolic dynamics (37B10) Constructive real analysis (26E40) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Degrees of difficulty of generalized r.e. separating classes
• On the dynamics and recursive properties of multidimensional symbolic systems
• On the computability of fractal dimensions and Hausdorff measure
• On the computational power of dynamical systems and hybrid systems
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions
• Mass Problems and Randomness
• Computability of Countable Subshifts
• Non-computable Julia sets

This page was built for publication: Conservatively Approximable Functions