Title: on the Learnability of Counting Functions

@inproceedings{Homer2007TitleOT,
  title={Title: on the Learnability of Counting Functions},
  author={Steven Homer and Zhixiang Chen},
  year={2007}
}
We examine the learnability of concepts based on counting functions. A counting function is a generalization of a parity function in which the weighted sum of n inputs is tested for equivalence to some value k modulo N . The concepts we study therefore generalize many commonly studied boolean functions. We first show that disjunctions of counting functions (DOCFs) with modulus N are learnable by equivalence queries and determine the number of queries sufficient and necessary. We show that α(N)n… CONTINUE READING