Coding and complexity

[1]  Gregory. J. Chaitin,et al.  Algorithmic information theory , 1987, Cambridge tracts in theoretical computer science.

[2]  C. S. Wallace,et al.  Estimation and Inference by Compact Coding , 1987 .

[3]  J. Rissanen.  Stochastic Complexity and Modeling , 1986 .

[4]  Jorma Rissanen,et al.  Complexity of strings in the class of Markov sources , 1986, IEEE Trans. Inf. Theory.

[5]  Jorma Rissanen,et al.  Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.

[6]  Leonid A. Levin,et al.  Randomness Conservation Inequalities; Information and Independence in Mathematical Theories , 1984, Inf. Control..

[7]  A. F. Smith.  Present Position and Potential Developments: Some Personal Views Bayesian Statistics , 1984 .

[8]  A. P. Dawid,et al.  Present position and potential developments: some personal views , 1984 .

[9]  A. N. Kolmogorov.  Combinatorial foundations of information theory and the calculus of probabilities , 1983 .

[10]  J. Rissanen.  A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .

[11]  Raphail E. Krichevsky,et al.  The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.

[12]  George E. P. Box,et al.  Sampling and Bayes' inference in scientific modelling and robustness , 1980 .

[13]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[14]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[15]  G. Chaitin.  Algorithmic Information Theory , 1987, IBM J. Res. Dev..

[16]  Hirotugu Akaike,et al.  On entropy maximization principle , 1977 .

[17]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[18]  G. Chaitin.  A Theory of Program Size Formally Identical to Information Theory , 1975, JACM.

[19]  Lee D. Davisson,et al.  Universal noiseless coding , 1973, IEEE Trans. Inf. Theory.

[20]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.

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

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

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

[24]  John G. Kemeny,et al.  The Use of Simplicity in Induction , 1953 .