文章基本信息
- 标题：Kolmogorov Complexity Conditional to Large Integers
- 本地全文：下载
- 作者：Nikolai Vereshchagin
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2001
- 卷号：2001
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：Assume that for almost all n Kolmogorov complexity of a string x conditional to n is less than m. We prove that in this case there is a program of size m+O(1) that given any sufficiently large n outputs x.
- 关键词：Kolmogorov complexity
