论文信息 - Robustness of Logical Depth

Robustness of Logical Depth

Usually one can quantify the subjective notion of useful information in two different perspectives: static resources --- measuring the amount of planing required to construct the object; or dynamic resources --- measuring the computational effort required to produce the object. We study the robustness of logical depth measuring dynamic resources, proving that small variations in the significance level can cause large changes in the logical depth.

[1] Pieter Adriaans,et al. Facticity as the amount of self-descriptive information in a data set , 2012, ArXiv.

[2] Seth Lloyd,et al. Information measures, effective complexity, and total information , 1996 .

[3] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[4] R. Herken,et al. A half-century survey on The Universal Turing Machine , 1988 .

[5] Lance Fortnow,et al. Computational depth: Concept and applications , 2006, Theor. Comput. Sci..

[6] David H. Wolpert,et al. Using self-dissimilarity to quantify complexity , 2007, Complex..

[7] Moshe Koppel,et al. Complexity, Depth, and Sophistication , 1987, Complex Syst..

[8] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[9] Paul M. B. Vitányi,et al. Meaningful Information , 2001, IEEE Transactions on Information Theory.

[10] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[11] Charles H. Bennett. Logical depth and physical complexity , 1988 .

[12] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[13] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .

[14] Lance Fortnow,et al. Sophistication Revisited , 2003, Theory of Computing Systems.