Effective Fractal Dimension in Algorithmic Information Theory
Effective Fractal Dimension in Algorithmic Information Theory
复制标题
算法信息论中的有效分形维数
DOI：
10.1007/978-0-387-68546-5_12
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Elvira Mayordomo
中科院分区：
文献类型：
--
作者：
Elvira Mayordomo
Lutz（2003）为了定量分析复杂性类的结构而定义了有效分形维数，但随后也发现了有效维数与信息论的有趣联系，证明了维数是一种信息含量度量的长期存在的直觉。考虑到不同的界限计算能力，范围从有限的内存，建设性，包括时间有界和空间有界的计算，我们回顾所有已知的有效尺寸的特征，支持有效尺寸捕获什么可以被认为是在每个设置的序列的固有信息内容的论文。
Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes, but then interesting connections of effective dimension with information theory were also found, justifying the long existent intuition that dimension is an information content measure. Considering different bounds on computing power that range from finite memory to constructibility, including time-bounded and space-bounded computations, we review all known characterizations of effective dimension that support the thesis that effective dimensions capture what can be considered the inherent information content of a sequence in each setting.
DOI：
10.2307/2532125
发表时间：
1990-03
期刊：
--
影响因子：
--
作者：
K. Falconer
通讯作者：
K. Falconer