The combined universal probability $\mathbf{m}(D)$ of strings $x$ in sets $D$ is close to max $\mathbf{m}(x)$ over $x$ in $D$: their logs differ by at most $D$'s information $\mathbf{I}(D:\mathcal{H})$ about the halting sequence $\mathcal{H}$.

翻译：字符串集合$D$中字符串$x$的联合通用概率$\mathbf{m}(D)$接近于$D$中$x$的最大$\mathbf{m}(x)$值：它们的对数差异不超过$D$关于停机序列$\mathcal{H}$的信息量$\mathbf{I}(D:\mathcal{H})$。