Who Asked Us? How the Theory of Computing Answers Questions about Analysis

DOI10.1007/978-3-030-41672-0_4zbMath1440.68144arXiv1912.00284OpenAlexW2990706031MaRDI QIDQ3297823

Publication date: 20 July 2020

Published in: Complexity and Approximation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.00284

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fractals (28A80) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to measure and integration (28-02)

Related Items (3)

Extending the reach of the point-to-set principle ⋮ Dimension and the structure of complexity classes ⋮ Unnamed Item

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The computational complexity of distance functions of two-dimensional domains
A polynomial-time computable curve whose interior has a nonrecursive measure
Hausdorff dimension and capacities of intersections of sets in n-space
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
Jordan curves with polynomial inverse moduli of continuity
Turing oracle machines, online computing, and three displacements in computability theory
Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
Descriptive set theory
On the computability of fractal dimensions and Hausdorff measure
A Kolmogorov complexity characterization of constructive Hausdorff dimension.
The dimensions of individual strings and sequences
Bounding the dimension of points on a line
On the complexity of computing the Hausdorff distance
Sixty Years of Fractal Projections
Furstenberg sets for a fractal set of directions
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
Algorithmic Randomness and Complexity
Lines missing every random point1
Effective Strong Dimension in Algorithmic Information and Computational Complexity
Dimensions of Points in Self-Similar Fractals
On the Hausdorff dimension and capacities of intersections
Packing dimension and Cartesian products
Two counterexamples concerning Hausdorff dimensions of projections
Two definitions of fractional dimension
Kolmogorov Complexity and Algorithmic Randomness
Computational Complexity of Two-Dimensional Regions
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
Fractal Intersections and Products via Algorithmic Dimension
Computability and Randomness
The definition of random sequences
Packing dimension, Hausdorff dimension and Cartesian product sets
Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions
An introduction to Kolmogorov complexity and its applications
Logical operations and Kolmogorov complexity

This page was built for publication: Who Asked Us? How the Theory of Computing Answers Questions about Analysis