A circuit complexity formulation of algorithmic information theory (Q6090675): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational limitations on learning from examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the smallest grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A philosophical treatise of universal induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian learning for neural networks / rank
 
Normal rank

Latest revision as of 13:36, 19 August 2024

scientific article; zbMATH DE number 7767809
Language Label Description Also known as
English
A circuit complexity formulation of algorithmic information theory
scientific article; zbMATH DE number 7767809

    Statements

    A circuit complexity formulation of algorithmic information theory (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2023
    0 references
    solomonoff induction
    0 references
    Kolmogorov complexity
    0 references
    algorithmic information theory
    0 references
    circuit complexity
    0 references
    sequence prediction
    0 references
    Boolean functions
    0 references

    Identifiers