Inductive reasoning and Kolmogorov complexity
In this comprehensive note, the authors discuss several basic senses of inductive inference and their generalization to inductive reasoning. Neither Zadeh-type fuzzy reasoning nor Peirce-type abductive reasoning is addressed there. In the process, the authors refine Ockham's Rozor and combine principles of Epicurus, Ockham and Bayes in various useful ways, e.g., in relation to the non-effective notion of Kolmogorov complexity. The main thesis of this detailed, analytical paper is that various theories, approaches, simulations, models, programs and principles of inductive reasoning can be formulated as specific computable approximations to \textit{R. J. Solomonoff's} [Inform. and Control 7, 1-22 (1964; Zbl 0258.68045)] non-effective procedures.
scientific article; zbMATH DE number 58813
scientific article