{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "18DPY9J8YP"
    },
    {
      "field": "uses",
      "target": "X5KD3X3VJ3"
    }
  ],
  "body": "\n## Summary\n\nThe Kolmogorov complexity of a finite string is the length of a shortest program that prints the string.\nIt measures how much information the string contains, or how far it can be compressed.\nBy the invariance theorem the choice of programming language changes the complexity only by a bounded amount.\nIt is the basis of algorithmic information theory and of [[algorithmic randomness|KW3V44GPPC]].\n\n## Explanations\n\n### L1 human\n\nA string like $0101010101\\ldots01$ with a million digits has a short description: \"print $01$ half a million times\".\nA string of a million coin flips usually has no description much shorter than the string itself.\nKolmogorov complexity makes this precise: it is the length of the shortest program that outputs the string.\nSimple, patterned strings have low complexity, and typical random strings have complexity close to their length.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "kind": "concept",
    "msc": [
      "68Q30",
      "03D32"
    ],
    "name": "Kolmogorov complexity",
    "same_as": {
      "wikidata": "Q1456811",
      "wikipedia": "Kolmogorov complexity"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Kolmogorov_complexity"
      }
    ],
    "tag": "8PY3K6NCKF"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/8PY3K6NCKF/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/8PY3K6NCKF.md",
  "msc": [
    "68Q30",
    "03D32"
  ],
  "name": "Kolmogorov complexity",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/8PY/8PY3K6NCKF.md",
  "status": null,
  "tag": "8PY3K6NCKF",
  "uri": "m2://8PY3K6NCKF",
  "url": "https://math2.tamnd.com/wiki/kolmogorov-complexity/",
  "writing": {
    "tag": "8PY3K6NCKF",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}