Finding an LR wrapper: Algorithm
na�ve algorithm enumerate all combinations for each candidate l1 for each candidate r1 ��� for each candidate lK
for each candidate rK succeed if consistent with examples
S = length of examples K = number of attributes
Real �ave case� value is K L^(2/3) so this stmt is not wrong but say this so it won�t confuse anyone