h 01)</p>
<ul>
<li><p>definition close to Kolmogorov / shannon entropy</p></li>
<li><p>adds context dependence</p></li>
<li><p>kolmogorov complexity = algorithmic information complexity</p>
<ul>
<li><p>problem 1: must assume a particular Universal Turing machine (which might give differing results)</p></li>
<li><p>problem 2: random sequences have max complexity, even though they contain no information</p></li>
</ul>
</li>
<li><p>soln</p>
<ul>
<li><p>incorporate context - what descriptions are the same?</p><