Fractal dimension versus process complexity

DOI10.1155/2016/5030593zbMath1401.68078arXiv1309.1779OpenAlexW2963260578WikidataQ59122514 ScholiaQ59122514MaRDI QIDQ504699

Fernando Soler-Toscano, Joost J. Joosten, Hector Zenil

Publication date: 17 January 2017

Published in: Advances in Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fractals (28A80)

Related Items

Average Hewitt-Stromberg and box dimensions of typical compact metric spaces, Nonlocal fractal neutrons transport equation and its implications in nuclear engineering

Uses Software

• Wolfram Demonstrations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
• Correspondence principles for effective dimensions
• Constructive dimension equals Kolmogorov complexity
• Computability of Julia sets
• Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• Frontier between decidability and undecidability: A survey
• On the sum of digits of real numbers represented in the dyadic system. (On sets of fractional dimensions II.)
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• The dimensions of individual strings and sequences
• Irreducibility and computational equivalence. 10 years after Wolfram's a new kind of science
• Small fast universal Turing machines
• Algorithmic Randomness and Complexity
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• The measure theory of random fractals
• ∑1-Density and Turing Degrees
• Two definitions of fractional dimension
• Sets of Fractional Dimensions (IV): On Rational Approximation to Real Numbers
• On Non-Computable Functions
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• A formal theory of inductive inference. Part II
• Dynamics in One Complex Variable. (AM-160)
• Sets of Fractional Dimensions (V): on Dimensional Numbers of Some Continuous Curves
• On Sets of Fractional Dimensions (III)
• An introduction to Kolmogorov complexity and its applications