General linear relations between different types of predictive complexity (Q5958290): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: How to use expert advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4933945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Approximation Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability theory for the Brier game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of prediction with expert advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Message Length and Kolmogorov Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank

Revision as of 22:21, 3 June 2024

scientific article; zbMATH DE number 1715291
Language Label Description Also known as
English
General linear relations between different types of predictive complexity
scientific article; zbMATH DE number 1715291

    Statements

    General linear relations between different types of predictive complexity (English)
    0 references
    0 references
    3 March 2002
    0 references
    computational learning theory
    0 references
    generalisation of Kolmogorov complexity
    0 references
    tight inequalities
    0 references

    Identifiers