 ##  [Kolmogorov Complexity](/kolmogorov-complexity) 

  ##  [Kolmogorov Complexity](https://natural.quantumdictionary.io/kolmogorov-complexity-0) 

  
 [![Natural & Formal Sciences Dictionary](/sites/default/files/styles/large/public/2026-01/Natural%20%26%20Formal%20Sciences.png.webp?itok=2kCDRVQv)](/topic-specific-dictionaries/natural-formal-sciences)


**Natural &amp; Formal Sciences Dictionary**

 
Definition

A measure of the algorithmic information content of a finite object, defined as the length of the shortest description (program plus input) on a fixed universal description machine that produces the object.

 
 ##  [Kolmogorov Complexity](https://mathlogic.quantumdictionary.io/kolmogorov-complexity-1) 

  
 [![Mathematics & Logic Dictionary](/sites/default/files/styles/large/public/2026-01/Mathematics%20%26%20Logic.png.webp?itok=UhtTRPnp)](/topic-specific-dictionaries/natural-formal-sciences/mathematics-logic)

- Natural &amp; Formal Sciences -

**Mathematics &amp; Logic Dictionary**

 
Definition

The length (in bits) of the shortest effective description or program that, when run on a fixed universal Turing machine, outputs a given finite string, considered up to an additive constant depending on the choice of universal machine.