On unstable and unoptimal prediction

DOI10.1002/malq.201800085OpenAlexW2970617299MaRDI QIDQ5108858

Tomasz Steifer, Dariusz Kalociński

Publication date: 6 May 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201800085

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (1)

On universal algorithms for classifying and predicting stationary processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the notion of infinite pseudorandom sequences
• Guessing the next output of a stationary process
• Process complexity and effective random tests
• Asymptotic density and the coarse computability bound
• Algorithmic Randomness and Complexity
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Notions of weak genericity
• Can an individual sequence of zeros and ones be random?
• Finite-Memory Universal Prediction of Individual Sequences
• Prediction and Entropy of Printed English
• A simple randomized algorithm for sequential prediction of ergodic time series
• Resource-bounded balanced genericity, stochasticity and weak randomness
• Inductive inference of approximations
• The strong law of large numbers for sequential decisions under uncertainty
• Investigating Causal Relations by Econometric Models and Cross-spectral Methods

This page was built for publication: On unstable and unoptimal prediction