文章基本信息

标题：Descriptive complexity of computable sequences
本地全文：下载
作者：Bruno Durand ; Alexander Shen ; Nikolai Vereshchagin 等
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We study different notions of descriptive complexity of computable sequences. Our main result states that if for almost all n the Kolmogorov complexity of the n-prefix of an infinite binary sequence x conditional to n is less than m then there is a program of length m^2+O(1) that for almost all n given n as input prints the n-prefix of x. We prove that this bound is tight up to a constant factor.
关键词：computable sequence , initial segment , Kolmogorov complexity