Solomonoff induction is uncomputable, thus, as a direct consequence, it cannot be learned. Some approximations to it which are of practical interest: Occam learning and probably approximately correct learning. As a general matter, these questions are addressed by computational learning theory.
Solomonoff induction is uncomputable, thus, as a direct consequence, it cannot be learned. Some approximations to it which are of practical interest: Occam learning and probably approximately correct learning. As a general matter, these questions are addressed by computational learning theory.