Two Kinds of Probabilistic Induction (1999)

Cached

Download Links

by Ray J. Solomonoff
Venue:COMPUTER JOURNAL
Citations:7 - 1 self

Active Bibliography

2 Three Kinds Of Probabilistic Induction: Universal Distributions and Convergence Theorems – Ray J. Solomonoff - 2003
22 The discovery of algorithmic probability – Ray J. Solomonoff, Royal Holloway - 1997
3 Does Algorithmic Probability Solve the Problem of Induction? – Ray Solomonoff - 2001
Algorithmic Probability—Theory and Applications – Ray J. Solomonoff - 2009
4 Computational Machine Learning in Theory and Praxis – Ming Li, Paul Vitányi - 1995
41 A tutorial introduction to the minimum description length principle – Peter Grünwald
Randomness – Paul Vitányi - 1995
Simplicity, Information, Kolmogorov Complexity, and Prediction – Paul Vitányi, Ming Li - 1998
4 Open Problems in Universal Induction & Intelligence – Marcus Hutter - 2009
17 Applying MDL to Learning Best Model Granularity – Qiong Gao, Ming Li, Paul Vitányi - 1994
60 Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity – Paul Vitányi, Ming Li - 1998
9 On Prediction by Data Compression – Paul Vitányi, Ming Li - 1997
15 Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences – V.V. V'Yugin - 1999
18 Lecture Notes on Descriptional Complexity and Randomness – Peter Gács
14 The Generalized Universal Law of Generalization – Nick Chater, Paul M.B. Vitányi - 2001
unknown title – Raymond J. Solomonoff, Peter Gács, Paul M. B. Vitányi - 2010
Introducing the Minimum Description Length Principle – Peter Grünwald
1 Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection – Aaron D. Lanterman - 2000
Short Course: Introduction to Information-Theoretic Modeling Fifth Brazilian Conference on Statistical Modelling in Insurance and Finance – Teemu Roos - 2011