On the Centred Hausdorff Measure of the Sierpinski Gasket
Marta LLorente, Mar\'ia Eugenia Mera, Manuel Mor\'an

TL;DR
This paper demonstrates that the centred Hausdorff measure of the Sierpinski gasket is both continuous- and algorithmically-computable, providing precise numerical estimates and bounds for this measure and related spherical Hausdorff measure.
Contribution
It introduces a method to compute the centred Hausdorff measure of the Sierpinski gasket and establishes its approximate value along with bounds for the spherical Hausdorff measure.
Findings
Centred Hausdorff measure is C- and A-computable.
Estimated value of the measure is approximately 1.0049.
Bound for the spherical Hausdorff measure is approximately 0.8616 to 0.8619.
Abstract
We show that the centred Hausdorff measure, with of the Sierpinski gasket , is -computable (continuous-computable), in the sense that its value is the solution of the minimisation problem of a continuous function on a compact domain. We also show that is -computable (algorithmic-computable) in the sense that there is an algorithm that converges to with error bounds tending to zero. Using this algorithm and bounds we show that and we establish a conjecture for the value of the spherical Hausdorff -measure of , and provide an upper bound for it,
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Mathematical Dynamics and Fractals · Digital Image Processing Techniques
