Revision as of 15:56, 17 September 2006 edit Ysamal (talk \| contribs) 9 edits m →Feature selection ← Previous edit		Revision as of 15:57, 17 September 2006 edit undo Ysamal (talk \| contribs) 9 edits m →Optimal O notation learning Next edit →
Line 34: * E. M. Gold. Language identification in the limit. Information and Control, 10:447--474, 1967. ===Optimal O notation learning=== * O. Goldreich, D. Ron. On universal learning algorithms. http://citeseer.njist.~~nec~~psu.~~com~~edu/69804.html ===Negative results=== * M. Kearns and L. G. Valiant. 1989. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433--444, New York. ACM. http://citeseer.ist.psu.edu/kearns89cryptographic.html

Computational learning theory: Difference between revisions