K-trivial、K-low和MLR-low序列：教程
K-trivial, K-low and MLR-low sequences: a tutorial
摘要：
算法随机性和算法信息论的一个显著成就是发现了K-平凡集、K-低集和马丁-洛夫-随机低集的概念：三个不同的定义由于非常重要的原因而被证明是等价的。本文根据作者之一（L.B.）在Poncelet实验室（CNRS，莫斯科）在2014年，提供了这种等价性的证明和一些相关结果的阐述。我们假设读者熟悉算法信息论的基本概念。
英文摘要：
A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K-trivial, K-low and Martin-Lof-random-low sets: three different definitions turns out to be equivalent for very non-trivial reasons. This paper, based on the course taught by one of the authors (L.B.) in Poncelet laboratory (CNRS, Moscow) in 2014, provides an exposition of the proof of this equivalence and some related results. We assume that the reader is familiar with basic notions of algorithmic information theory.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
