Pages that link to "Item:Q1336479"

The following pages link to The complexity and effectiveness of prediction algorithms (Q1336479):

Displaying 13 items.

• Constructive dimension equals Kolmogorov complexity (Q835015) (← links)
• Fractal dimension and logarithmic loss unpredictability. (Q1401414) (← links)
• On asymptotically optimal methods of prediction and adaptive coding for Markov sources (Q1599202) (← links)
• Prediction and dimension (Q1780452) (← links)
• A Kolmogorov complexity characterization of constructive Hausdorff dimension. (Q1853096) (← links)
• Finite-state dimension (Q1884962) (← links)
• The dimensions of individual strings and sequences (Q1887139) (← links)
• Subcomputable Hausdorff function dimension (Q2235747) (← links)
• The Kolmogorov complexity of infinite words (Q2383593) (← links)
• Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series (Q2503313) (← links)
• Experimental investigation of forecasting methods based on data compression algorithms (Q2577286) (← links)
• Algorithmic Fractal Dimensions in Geometric Measure Theory (Q5024574) (← links)
• Fractal Intersections and Products via Algorithmic Dimension (Q5111274) (← links)