Two Kinds of Probabilistic Induction (1999)

Cached

Download Links

by Ray J. Solomonoff
Venue:COMPUTER JOURNAL
Citations:9 - 1 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
405 A formal theory of inductive inference – R J Solomonoff - 1964
311 An Information Measure for Classification – C S Wallace, D M Boulton
495 Stochastic complexity – J Rissanen - 1987
188 Estimation and inference by compact coding – C S Wallace, P R Freeman - 1987
1151 Modeling by shortest data description – J Rissanen - 1978
30 The Application Of Algorithmic Probability to Problems in Artificial Intelligence – Ray Solomonoff - 1986
128 Complexity-based induction systems: comparisons and convergence theorems – R J Solomonoff - 1978
2 How to Measure the – Z Bien, Y T Kim, S H Yang - 1998
2 Complexity-based induction sytems: comparisons and convergence theorems – R J Solomonoff - 1978
3 A Formalization of the Turing Test (The Turing Test as an Interactive Proof System – P G Bradford, M Wollowski - 1995
3 Randomness and Gödel's Theorem – G. J. Chaitin - 1986
19 Three Approaches to the Quantitative Definition – A N Kolmogorov - 1965
43 Universal search problems – L A Levin - 1973
30 A Formal Definition of Intelligence Based on an Intensional Variant of Algorithmic Complexity – Jose Hernandez-orallo, Neus Minaya-collado - 1998
9 A model for intelligence – H J Eysenck - 1982
32 The Universal Turing Machine A Half-Century Survey – R Herken - 1988
258 Toward a mathematical theory of inductive inference – Lenore Blum, Manuel Blum - 1975
1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936