Kolmogorov Complexity

Kolmogorov Complexity is a formal measure of computational complexity that belongs to the class of algorithmic information measures, distinguished by quantifying the minimal length of a self-delimiting program required to reconstruct a given string on a universal Turing machine.

522

Publications

33.3K

Citations

871

Authors

490

Institutions

Publications per year

2017–2026

74

Authors

871

  1. PV
    Paul Vitányi

    Centrum Wiskunde & Informatica, Netherlands

    42 publications · 6.4K citations

    25

    h-index

  2. HZ
    Héctor Zenil

    Karolinska Institutet, Sweden

    15 publications · 683 citations

    12

    h-index

  3. JD
    Jean-Paul Delahaye

    Laboratoire d'Informatique Fondamentale de Lille, France

    12 publications · 682 citations

    11

    h-index

  4. AS
    Alexander Shen

    Institute for Information Transmission Problems, Russia

    11 publications · 472 citations

    10

    h-index

  5. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    8 publications · 929 citations

    8

    h-index

1–5 of 871

Venues

  1. IEEE Transactions on Information Theory

    29 publications · 5.2K citations

    24

    h-index

  2. arXiv (Cornell University)

    Repository · 19 publications · 515 citations

    13

    h-index

  3. SIAM Journal on Computing

    14 publications · 668 citations

    12

    h-index

  4. Entropy

    16 publications · 547 citations

    12

    h-index

  5. Theoretical Computer Science

    11 publications · 979 citations

    11

    h-index

1–5