P
Initializing...
Theorem 2.3: k-decision lists are PAC learnable by the greedy decision-list algorithm, which never fails and whose outputs are consistent · Prove2Me