Natural Versus "universal" Probability, Complexity, And Entropy
暂无分享,去创建一个
[1] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[2] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[3] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[4] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[5] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[6] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[7] Gregory. J. Chaitin,et al. Algorithmic information theory , 1987, Cambridge tracts in theoretical computer science.
[8] Ming Li,et al. Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87 , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[9] W. H. Zurek,et al. Thermodynamic cost of computation, algorithmic complexity and the information metric , 1989, Nature.
[10] Lawrence D. Jackel,et al. Backpropagation Applied to Handwritten Zip Code Recognition , 1989, Neural Computation.