Base invariance of feasible dimension

DOI10.1016/j.ipl.2013.04.004zbMath1284.68309OpenAlexW2115084139WikidataQ60578947 ScholiaQ60578947MaRDI QIDQ2444767

Elvira Mayordomo, John M. Hitchcock

Publication date: 11 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.04.004

zbMATH Keywords

computational complexityalgorithmic information theoryeffective dimension

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fractals (28A80) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Base invariance of feasible dimension ⋮ Effective Hausdorff dimension in general metric spaces ⋮ Scaled dimension and the Kolmogorov complexity of Turing-hard sets ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory ⋮ Feasible analysis, randomness, and base invariance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On normal numbers
• Entropy rates and finite-state dimension
• Almost everywhere high nonuniform complexity
• Fractal dimension and logarithmic loss unpredictability.
• Finite-state dimension
• The dimensions of individual strings and sequences
• Dimension is compression
• Base invariance of feasible dimension
• Dimension, entropy rates, and compression
• Endliche Automaten und Zufallsfolgen
• Effective fractal dimensions
• Algorithmic Randomness and Complexity
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Dimension in Complexity Classes

This page was built for publication: Base invariance of feasible dimension