An introducation to computational learning theory:

Chapter 1

1.5 In Definition 2, we modified the PAC medel to allow the learning algorithm time polynomical in n and seze(c), and also provided the vale size(c) as input. Prove that this input in actually unnecessary: if ther is a an efficient PAC learning algorthm for C that is give size(c) as inout, then there is an efficient PAC learning algorthim for C that is not given,