Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity (1998)

Cached

Download Links

by Paul Vitányi , Ming Li
Venue:IEEE Transactions on Information Theory
Citations:67 - 7 self

Documents Related by Co-Citation

1689 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
532 Three approaches to the quantitative definition of information – A N Kolmogorov - 1965
8569 Elements of Information Theory – T M Cover, J A Thomas - 1991
495 Stochastic complexity – J Rissanen - 1987
311 An Information Measure for Classification – C S Wallace, D M Boulton
1151 Modeling by shortest data description – J Rissanen - 1978
128 Complexity-based induction systems: comparisons and convergence theorems – R J Solomonoff - 1978
305 The minimum description length principle in coding and modeling – Andrew Barron, Jorma Rissanen, Senior Member, Bin Yu, Senior Member - 1998
189 The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms – A. K. Zvonkin, L. A. Levin - 1970
334 The Definition of Random Sequences – Per Martin-Löf - 1966
286 Universal coding, information, prediction, and estimation – J Rissanen - 1984
50 A formal theory of inductive inference: Parts 1 and 2 – R J Solomonoff
276 Fisher information and stochastic complexity – J J Rissanen - 1996
23 New Error Bounds for Solomonoff Prediction – Marcus Hutter - 1999
308 Inductive inference: Theory and methods – D Angluin, C H Smith - 1983
25 Optimality of universal Bayesian prediction for general loss and alphabet – M Hutter - 2003
59 Inductive Reasoning and Kolmogorov Complexity – Ming Li, Paul M B Vitányi - 1992
29 Minimum Description Length Induction – P M B Vitányi, M Li
5 Algorithmic theories of everything. (Report IDSIA-20-00 – J Schmidhuber - 2000