摘要: Abstract The distribution-independent model of concept learning from examples (“PAC-learning”) due to Valiant (1984) is investigated. It has been shown that the existence an Occam algorithm for a class concepts sufficient condition PAC-learnability (Blumer 1987, 1989). (An randomized polynomial-time that, when given as input sample strings some unknown be learned, outputs small description consistent with sample.) In this paper it many natural classes implies class. More generally, property closure under exception lists defined, and any property, equivalent An interpretation these results classes, data compression.