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:60 - 7 self

Documents Related by Co-Citation

1412 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
396 Three approaches to the quantitative definition of information – A N Kolmogorov - 1968
6517 Elements of Information Theory – T M Cover, J A Thomas - 1991
426 Stochastic Complexity – J Rissanen - 1989
108 Complexity-Based Induction Systems: Comparisons and Convergence Theorems – R J Solomonoff - 1978
238 The minimum description length principle in coding and modeling – A Barron, J Rissanen, B Yu - 1998
269 An Information Measure for Classification – C Wallace, D Boulton - 1968
227 Fisher information and stochastic complexity – J Rissanen - 1996
8 A formal theory of inductive inference: Part 1 and 2 – R J Solomono - 1964
17 Complexity-based induction systems: Comparisons and convergence theorems – R J Solomono↵ - 1978
138 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
286 Inductive inference: Theory and methods – D ANGLUIN, C H SMITH - 1983
86 Randomness conservation inequalities: Information and independence in mathematical theories – L A Levin - 1984
57 Inductive reasoning and Kolmogorov complexity – M Li, P M B Vitányi - 1992
37 A formal theory of inductive inference. part 1 & 2 – Ray J Solomonoff - 1964
891 Modeling by the Shortest Data Description – J Rissanen - 1978
22 Optimality of universal Bayesian prediction for general loss and alphabet – M Hutter
5 Algorithmic theories of everything (Report IDSIA-20-00 – J Schmidhuber - 2000
18 Three approaches to the quantitative de of information – A N Kolmogorov - 1965