On the computability of fractal dimensions and Hausdorff measure

DOI10.1016/S0168-0072(97)00060-2zbMath0926.03049MaRDI QIDQ1295381

Ker-I. Ko

Publication date: 24 June 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

Julia sets; Hausdorff dimension; Hausdorff measure; computable functions; recursive real numbers; recursively approximable sets; polynomial-time computable real functions; computable curve

Mathematics Subject Classification ID

03F60: Constructive and recursive analysis

28A80: Fractals

03D15: Complexity of computation (including implicit computational complexity)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03D80: Applications of computability and recursion theory

Related Items

Effective Symbolic Dynamics, Unnamed Item, Effectiveness in RPL, with applications to continuous logic, Computability of countable subshifts in one dimension, Computability of measurable sets via effective topologies, On the complexity of computing the logarithm and square root functions on a complex domain, Computability structure of the Sobolev spaces and its applications, A theory of complexity for continuous time systems, Effectively closed sets and graphs of computable real functions., A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality, In Memoriam: Ker-I Ko (1950–2018), Who Asked Us? How the Theory of Computing Answers Questions about Analysis, Conservatively Approximable Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time computable curve whose interior has a nonrecursive measure
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• Recursive analysis
• Fractals, dimension, and formal languages
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Computational Complexity of Two-Dimensional Regions