scientific article; zbMATH DE number 2080658

MaRDI QIDQ4473554zbMATH OpenFDO

Authors Michael V. Vyugin, Vladimir V. V'yugin

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2225/22250190.htm

Mathematics Subject Classification ID

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

Recommendations

• General linear relations between different types of predictive complexity
• On complexity of easy predictable sequences
• How many strings are easy to predict?
• Predictive complexity and information
• scientific article; zbMATH DE number 2089356

Cited in

(7)

• General linear relations between different types of predictive complexity
• scientific article; zbMATH DE number 2089356 (Why is no real title available?)
• On complexity of easy predictable sequences
• Asymmetry of the Kolmogorov complexity of online predicting odd and even bits
• Extremal relations between additive loss functions and the Kolmogorov complexity
• Predictive complexity and information
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction

This page was built for publication:

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