期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We present a simplified proof of Solovay-Calude-Coles theorem stating that there is an enumerable undecidable set with the following property: prefix complexity of its initial segment of length n is bounded by prefix complexity of n (up to an additive constant).
