"Kolmogorov complexity" meaning in English

See Kolmogorov complexity in All languages combined, or Wiktionary

Noun

Forms: Kolmogorov complexities [plural]
Head templates: {{en-noun|~}} Kolmogorov complexity (countable and uncountable, plural Kolmogorov complexities)
  1. (computing theory) The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object as output. Wikipedia link: Kolmogorov complexity Tags: countable, uncountable Categories (topical): Theory of computing Translations (complexity defined as the length of the shortest program): Kolmogorovova složitost [feminine] (Czech), Kolmogorov-kompleksisuus (Finnish), complexidade de Kolmogorov [feminine] (Portuguese)

Inflected forms

Download JSON data for Kolmogorov complexity meaning in English (2.4kB)

{
  "forms": [
    {
      "form": "Kolmogorov complexities",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "Kolmogorov complexity (countable and uncountable, plural Kolmogorov complexities)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object as output."
      ],
      "id": "en-Kolmogorov_complexity-en-noun-b00d8e0x",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "complexity",
          "complexity"
        ],
        [
          "information",
          "information"
        ],
        [
          "object",
          "object"
        ],
        [
          "program",
          "program"
        ],
        [
          "output",
          "output"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object as output."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "cs",
          "lang": "Czech",
          "sense": "complexity defined as the length of the shortest program",
          "tags": [
            "feminine"
          ],
          "word": "Kolmogorovova složitost"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "complexity defined as the length of the shortest program",
          "word": "Kolmogorov-kompleksisuus"
        },
        {
          "code": "pt",
          "lang": "Portuguese",
          "sense": "complexity defined as the length of the shortest program",
          "tags": [
            "feminine"
          ],
          "word": "complexidade de Kolmogorov"
        }
      ],
      "wikipedia": [
        "Kolmogorov complexity"
      ]
    }
  ],
  "word": "Kolmogorov complexity"
}
{
  "forms": [
    {
      "form": "Kolmogorov complexities",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "Kolmogorov complexity (countable and uncountable, plural Kolmogorov complexities)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "en:Theory of computing"
      ],
      "glosses": [
        "The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object as output."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "complexity",
          "complexity"
        ],
        [
          "information",
          "information"
        ],
        [
          "object",
          "object"
        ],
        [
          "program",
          "program"
        ],
        [
          "output",
          "output"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object as output."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Kolmogorov complexity"
      ]
    }
  ],
  "translations": [
    {
      "code": "cs",
      "lang": "Czech",
      "sense": "complexity defined as the length of the shortest program",
      "tags": [
        "feminine"
      ],
      "word": "Kolmogorovova složitost"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "complexity defined as the length of the shortest program",
      "word": "Kolmogorov-kompleksisuus"
    },
    {
      "code": "pt",
      "lang": "Portuguese",
      "sense": "complexity defined as the length of the shortest program",
      "tags": [
        "feminine"
      ],
      "word": "complexidade de Kolmogorov"
    }
  ],
  "word": "Kolmogorov complexity"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-16 from the enwiktionary dump dated 2024-05-02 using wiktextract (e268c0e and 304864d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.