暂无分享,去创建一个
[1] Alonzo Church,et al. A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.
[2] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[3] Cristian S. Calude,et al. Computing a Glimpse of Randomness , 2002, Exp. Math..
[4] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[5] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[6] John Tromp. Binary Lambda Calculus and Combinatory Logic , 2006, Kolmogorov Complexity and Applications.
[7] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[8] Gregory J. Chaitin,et al. A recent technical report , 1974, SIGA.
[9] A. Church. An Unsolvable Problem of Elementary Number Theory , 1936 .
[10] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[11] de Ng Dick Bruijn,et al. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .
[12] Cristian Claude,et al. Information and Randomness: An Algorithmic Perspective , 1994 .
[13] Marcus Hutter,et al. Algorithmic Information Theory , 1977, IBM J. Res. Dev..
[14] Gregory J. Chaitin,et al. Algorithmic Information Theory , 1987, IBM J. Res. Dev..
[15] Gregory J. Chaitin,et al. Elegant Lisp Programs , 2003 .
[16] Cristian S. Calude. Information and Randomness: An Algorithmic Perspective , 1994 .
[17] Gregory J. Chaitin. An Invitation to Algorithmic Information Theory , 1996, DMTCS.