scientific article; zbMATH DE number 2063224

MaRDI QIDQ4460840zbMATH OpenFDO

Authors Ker-I Ko

Publication date 29 March 2004

zbMATH Keywords

computable analysisfractalsHausdorff dimensionJulia setspolynomial-time computabilitysurvey

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Higher-type and set recursion theory (03D65) Constructive and recursive analysis (03F60) Length, area, volume, other geometric measure theory (28A75) Fractals (28A80) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the computability of fractal dimensions and Hausdorff measure
• Computational complexity of fractal sets
• On computational complexity of Siegel Julia sets
• On the complexity of computing the Hausdorff distance
• Non-computable Julia sets

Cited in

(13)

• On the computability of fractal dimensions and Hausdorff measure
• Computational complexity of fractal sets
• Computational properties of a fractal medium
• In Memoriam: Ker-I Ko (1950–2018)
• Who asked us? How the theory of computing answers questions about analysis
• scientific article; zbMATH DE number 1064115 (Why is no real title available?)
• Computational Complexity of Two-Dimensional Regions
• Jordan curves with polynomial inverse moduli of continuity
• Fractal dimension versus process complexity
• Computational unsolvability of domains of attraction of nonlinear systems
• scientific article; zbMATH DE number 2216397 (Why is no real title available?)
• On the complexity of computing the logarithm and square root functions on a complex domain
• Jordan curves with polynomial inverse moduli of continuity

This page was built for publication:

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