The complexity and effectiveness of prediction algorithms
From MaRDI portal
Publication:1336479
DOI10.1006/jcom.1994.1015zbMath0812.68082OpenAlexW1970972184MaRDI QIDQ1336479
Publication date: 22 November 1994
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1994.1015
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Parallel algorithms in computer science (68W10)
Related Items
Finite-state dimension ⋮ Constructive dimension equals Kolmogorov complexity ⋮ The dimensions of individual strings and sequences ⋮ The Kolmogorov complexity of infinite words ⋮ Fractal dimension and logarithmic loss unpredictability. ⋮ Fractal Intersections and Products via Algorithmic Dimension ⋮ Subcomputable Hausdorff function dimension ⋮ Prediction and dimension ⋮ Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series ⋮ Experimental investigation of forecasting methods based on data compression algorithms ⋮ A Kolmogorov complexity characterization of constructive Hausdorff dimension. ⋮ On asymptotically optimal methods of prediction and adaptive coding for Markov sources ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory
This page was built for publication: The complexity and effectiveness of prediction algorithms
