s="math notranslate nohighlight">\(K(x)\)</span> = the shortest computer program (in binary) that generates x (a binary string) = the ‚Äúamount of info‚Äù in x</p>
<ul>
<li><p>complexity of a string x is at most its length</p></li>
<li><p>algorithmically random - any string whose length is close to <span class="math notranslate nohighlight">\(|x|\)</span></p>
<ul>
<li><p>more random = higher complexity</p></li>
</ul>
</li>
</ul>
</li>
<li><p>Minimum description length original reference \cite{rissan