Complexity through nonextensivity
暂无分享，去创建一个
[1] A. Mackay. On complexity , 2001 .
[2] J. Rogers. Chaos , 1876, Molecular Vibrations.
[3] Vladimir Vapnik,et al. Statistical learning theory , 1998 .
[4] W. Ebeling,et al. Entropy and Long-Range Correlations in Literary English , 1993, chao-dyn/9309005.
[5] Naftali Tishby,et al. Predictability, Complexity, and Learning , 2000, Neural Computation.
[6] P. Grassberger. Toward a quantitative theory of self-generated complexity , 1986 .
[7] Vijay Balasubramanian,et al. Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions , 1996, Neural Computation.
[8] Jean-Raymond Abrial,et al. On B , 1998, B.
[9] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[10] W. H. Zurek. Complexity, Entropy and the Physics of Information , 1990 .
[11] Callan,et al. Field Theories for Learning Probability Distributions. , 1996, Physical review letters.
[12] Claude E. Shannon,et al. Prediction and Entropy of Printed English , 1951 .
[13] Peter Grassberger,et al. Entropy estimation of symbol sequences. , 1996, Chaos.
[14] W. Hilberg,et al. Der bekannte Grenzwert der redundanzfreien Information in Texten - eine Fehlinterpretation der Shannonschen Experimente? , 1990 .
[15] Jorma Rissanen,et al. Fisher information and stochastic complexity , 1996, IEEE Trans. Inf. Theory.