文章基本信息

标题：A Kolmogorov complexity characterization of constructive Hausdorff dimension
本地全文：下载
作者：Elvira Mayordomo
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We obtain the following full characterization of constructive dimension in terms of algorithmic information content. For every sequence A, cdim(A)=liminf_n (K(A[0..n-1])/n.
关键词：Hausdorff dimension , information theory , Kolmogorov complexity , Theory of Computation