Inductive reasoning and kolmogorov complexity
- 30 April 1992
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 44 (2) , 343-384
- https://doi.org/10.1016/0022-0000(92)90026-f
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Detection of the number of coherent signals by the MDL principleIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Maximum entropy as a special case of the minimum description length criterion (Corresp.)IEEE Transactions on Information Theory, 1986
- Combinatorial foundations of information theory and the calculus of probabilitiesRussian Mathematical Surveys, 1983
- A Universal Prior for Integers and Estimation by Minimum Description LengthThe Annals of Statistics, 1983
- Comparison of identification criteria for machine inductive inferenceTheoretical Computer Science, 1983
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Complexity-based induction systems: Comparisons and convergence theoremsIEEE Transactions on Information Theory, 1978
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- The Use of Simplicity in InductionThe Philosophical Review, 1953