Who Asked Us? How the Theory of Computing Answers Questions about Analysis
Preprint
Abstract
Algorithmic fractal dimensions -- constructs of computability theory -- have recently been used to answer open questions in classical geometric measure theory, questions of mathematical analysis whose statements do not involve computability theory or logic. We survey these developments and the prospects for future such results.Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- On the complexity of computing the Hausdorff distanceJournal of Complexity, 2013
- Jordan curves with polynomial inverse moduli of continuityTheoretical Computer Science, 2007
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domainJournal of Complexity, 2006
- The computational complexity of distance functions of two-dimensional domainsTheoretical Computer Science, 2005
- On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line PathsElectronic Notes in Theoretical Computer Science, 2005
- On the complexity of finding paths in a two-dimensional domain I: Shortest pathsMathematical Logic Quarterly, 2004
- The dimensions of individual strings and sequencesInformation and Computation, 2003
- On the computability of fractal dimensions and Hausdorff measureAnnals of Pure and Applied Logic, 1998
- Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groupsActa Mathematica, 1984
- Hausdorff dimension and capacities of intersections of sets in n-spaceActa Mathematica, 1984