Gacs-Kucera Theorem, tightened by Barmpalias and Lewis-Pye, w.t.t.-reduces each infinite sequence to a Kolmogorov--Martin-Lof random one and is broadly used in various Math and CS areas. Its early proofs are somewhat cumbersome, but using some general concepts yields significant simplification illustrated here.

翻译：Gacs-Kucera Theorem,由Barmpalias和Lewis-Pye(w.t.t.t.t.)收紧,将每个无限序列降为Kolmogorov-Martin-Lof随机序列,并广泛用于数学和CS领域。 早期证据有些繁琐,但使用一些一般概念可以实现这里所说明的显著简化。