In this note, the PAC-Learnability of a finite hypothesis class is proved for a learning problem in which the training set labels are flipped with a certain probability.