Probably approximately correct learnable (PAC)

machine-learning
Probably approximately correct learnable (PAC)

A concept class $C$ is probably approximately correct learnable by learner $L$ using hypothesis space $H$ with error $0 \leq \epsilon \leq 0.5$ and probability $0 \leq 1 - \delta \leq 1$ if and only if learner $L$ when ran on concept $c \in C$ with probability $1-\delta$ outputs hypothesis $h \in H$ such that the true error

$$Error_{\mathbb{D}}(h) \leq \epsilon$$

in time and samples polynomial in $\frac{1}{\epsilon}, \frac{1}{\delta}$ and $\vert H \vert$.