Fractal dimension and logarithmic loss unpredictability.

DOI10.1016/S0304-3975(03)00138-5MaRDI QIDQ1401414zbMATH OpenFDO

Authors John M. Hitchcock

Publication date 17 August 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(03)00138-5

zbMATH Keywords

Hausdorff dimension

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Fractal dimensions as chaos indicators
• Fractal dimension of random processes
• Fractal dimension as a criterion for systems stability
• On the efficient prediction of fractal signals
• Fractal Dimensions and Random Transformations
• Lacunarity of random fractals.
• Fractal dimension and vector quantization
• Random fractals and probability metrics

Cites work

• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• Algorithmic approach to the prediction problem
• Dimension in Complexity Classes
• Endliche Automaten und Zufallsfolgen
• scientific article; zbMATH DE number 2089375 (Why is no real title available?)
• scientific article; zbMATH DE number 44693 (Why is no real title available?)
• scientific article; zbMATH DE number 1754653 (Why is no real title available?)
• The complexity and effectiveness of prediction algorithms
• Universal prediction
• Universal prediction of individual sequences

Cited in

(22)

• Modelling fractal patterns via the qualitative equivalence of a nonlinear ODE
• Scaled dimension and the Kolmogorov complexity of Turing-hard sets
• Dimension extractors and optimal decompression
• Prediction and dimension
• Scaled dimension and nonuniform complexity
• Dimension is compression
• Generalised entropies and asymptotic complexities of languages
• Hausdorff dimension and oracle constructions
• Dimensions of Copeland-Erdös sequences
• Base invariance of feasible dimension
• Dimension, entropy rates, and compression
• scientific article; zbMATH DE number 2089375 (Why is no real title available?)
• Effective Dimensions and Relative Frequencies
• On thedimension of the predictive process of a memoryless channel
• Distance computation of ontology vector for ontology similarity measuring and ontology mapping
• Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
• Effective dimensions and relative frequencies
• Real numbers equally compressible in every base
• Entropy rates and finite-state dimension
• Fractal property of generalized M-set with rational number exponent
• Complex network dimension and path counts
• Pushdown dimension

This page was built for publication: Fractal dimension and logarithmic loss unpredictability.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401414)