We prove that log n-decision lists - the class of decision lists such that all their terms have low Kolmogorov complexity - are learnable in the simple PAC learning model. The proof is based on a transformation from an ...