Two Kinds of Probabilistic Induction (1999)
by
Ray J. Solomonoff
| Venue: | COMPUTER JOURNAL |
| Citations: | 7 - 1 self |
BibTeX
@ARTICLE{Solomonoff99twokinds,
author = {Ray J. Solomonoff},
title = {Two Kinds of Probabilistic Induction},
journal = {COMPUTER JOURNAL},
year = {1999},
volume = {42},
pages = {256--259}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 1412 | An Introduction to Kolmogorov Complexity and Its Applications - Li, Vitanyi - 1997 |
| 892 | Modeling by shortest data description - Rissanen - 1978 |
| 316 | A formal theory of inductive inference - Solomonoff - 1964 |
| 270 | An information measure for classification - Wallace, Boulton - 1968 |
| 258 | Stochastic Complexity in Statistical Inquiry - Rissanen - 1989 |
| 108 | Complexity-Based Induction Systems: Comparisons and Convergence Theorems - Solomonoff - 1978 |
| 65 | A Study of Grammatical Inference - Horning - 1969 |
| 25 | Some Equivalences Between Shannon Entropy and Kolmogorov Complexity - Leung-Yan-Cheong, Cover - 1978 |
| 21 | Computational complexity and probability constructions - Willis - 1970 |
