Inductive reasoning and Kolmogorov complexity
- 7 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 165-185
- https://doi.org/10.1109/sct.1989.41823
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On the learnability of Boolean formulaePublished by Association for Computing Machinery (ACM) ,1987
- Recent Results on Boolean Concept LearningPublished by Elsevier ,1987
- Combinatorial foundations of information theory and the calculus of probabilitiesRussian Mathematical Surveys, 1983
- On the rationale of maximum-entropy methodsProceedings of the IEEE, 1982
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- On the complexity of minimum inference of regular setsInformation and Control, 1978
- The definition of random sequencesInformation and Control, 1966
- AN ESSAY TOWARDS SOLVING A PROBLEM IN THE DOCTRINE OF CHANCESBiometrika, 1958