scientific article; zbMATH DE number 2080658

zbMATH Open1050.68079MaRDI QIDQ4473554FDOQ4473554

Vladimir V. V'yugin, Michael V. Vyugin

Publication date: 4 August 2004

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (6)

• General linear relations between different types of predictive complexity
• Title not available (Why is that?)
• On complexity of easy predictable sequences
• 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

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)