On the algorithmic complexity of static structures
暂无分享,去创建一个
[1] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[2] Joel Ratsaby. On the sysRatio and its critical point , 2011, Math. Comput. Model..
[3] Joel Ratsaby. An algorithmic complexity interpretation of Lin's third law of information theory , 2008, Entropy.
[4] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[5] Joel Ratsaby,et al. Prediction by Compression , 2010, ArXiv.
[6] Eitan M. Gurari,et al. Introduction to the theory of computation , 1989 .
[7] A. Church. A Set of Postulates for the Foundation of Logic , 1932 .
[8] Gregory J. Chaitin,et al. A recent technical report , 1974, SIGA.
[9] Gregory J. Chaitin,et al. Algorithmic Information Theory , 1987, IBM J. Res. Dev..
[10] Moshe M. Barash,et al. Complexity in manufacturing systems, Part 1: Analysis of static complexity , 1998 .
[11] Vladimir V. V'yugin,et al. Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences , 1999, Comput. J..
[12] John C. Shepherdson,et al. Computability of Recursive Functions , 1963, JACM.
[13] Joel Ratsaby. Some Consequences of the Complexity of Intelligent Prediction , 2010 .
[14] Joel Ratsaby. On the randomness in learning , 2009, 2009 IEEE International Conference on Computational Cybernetics (ICCC).
[15] E. Asarin. Some Properties of Kolmogorov $\Delta$-Random Finite Sequences , 1988 .
[16] Joel Ratsaby,et al. An empirical study of the complexity and randomness of prediction error sequences , 2011 .
[17] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[18] A. Shiryayev. On Tables of Random Numbers , 1993 .