Increasing the gap between descriptional complexity and algorithmic probability (Q3093481): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:48, 3 February 2024

scientific article
Language Label Description Also known as
English
Increasing the gap between descriptional complexity and algorithmic probability
scientific article

    Statements

    Increasing the gap between descriptional complexity and algorithmic probability (English)
    0 references
    0 references
    17 October 2011
    0 references
    0 references
    algorithmic probability
    0 references
    Gács theorem
    0 references
    coding theorem
    0 references