I didn&#x27;t claim it did - all I said is that this gives Occams Razor as an <i>asymptotic</i> law. Intuitively, I&#x27;m claiming:<p>Lim_{complexity -&gt; infinity} P(theory having fixed complexity) = 0<p>Stated more precisely, fix a prior distribution, then for any epsilon &gt; 0, I can find a complexity cutoff C (which depends on the prior) so that P(any theory with complexity &gt; C being true) &lt; epsilon.<p>This doesn&#x27;t mean that P(theory|complexity) is monotonically decreasing, that would be a much stronger claim.<p>I don&#x27;t know how this isn&#x27;t a compelling argument, it&#x27;s a provable mathematical statement.