Sign inSign in
ConceptAI & ML

Kolmogorov complexity

The complexity of something is defined as the length of the shortest explanation or description of that something.
as Étienne Ghys defines itCNRSThe wording closest to all 6 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

6

Each in their own terms, from the easiest level.

  • Ilya Sutskever

    UC Berkeley · Graduate

    The length of the shortest program that outputs a given piece of data.
    • 20:48An Observation on Generalization and Unsupervised Compression
  • Karl Friston

    University College London · Graduate

    Kolmogorov complexity and related literature on minimum description length and algorithmic complexity focus on minimizing the complexity cost of explanations or models.
    • 1:01:10The Physics of Motivation: An Active Inference Perspective
  • Bruno Bauwens

    HSE University · Graduate

    The definition of amount of information in an individual bit string, defined as the compression limit.
    • 2:40HSE Kolmogorov Complexity, Lecture 1: Computability and Solomonoff Induction
  • John Carlos Baez

    International Centre for Theoretical Physics · Research

    A notion of entropy that lets you define a concept of entropy for a single finite-length bit string.
    • 2:07Algorithmic Thermodynamics
  • John M. Aiken

    UT Austin · Research

    The length of the shortest computer program in a predetermined programming language that produces a given object as output.
    • 14:41Exploring System Dynamics in the Natural World with AI

Lectures that assume it

1

Connections

15

The lectures that define it or assume it, and the concepts next to it.

6 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.