An additivity theorem for plain Kolmogorov complexity (Q1946492): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977114030 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57349491 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1111.4372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical basis for information theory and probability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:23, 6 July 2024

scientific article
Language Label Description Also known as
English
An additivity theorem for plain Kolmogorov complexity
scientific article

    Statements

    An additivity theorem for plain Kolmogorov complexity (English)
    0 references
    0 references
    0 references
    15 April 2013
    0 references
    Kolmogorov complexity
    0 references
    symmetry of information
    0 references
    additivity of Kolmogorov complexity
    0 references
    plain complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references