Refinements of inductive inference by Popperian and reliable machines

Abstract

Restricted and unrestricted algorithmic devices which attempt to arrive in the limit at explanatory computer programs for input functions are studied. The input functions may be interpreted as summaries of the behavior of real world phenomena. A classification of criteria of success for such devices is made based on Karl Popper’s refutability principle in… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics