On universal learning algorithms☆
References (12)
- et al.
Learnability with respect to fixed distributions
Theoret. Comput. Sci.
(1991) - et al.
Results on learnability and the Vapnik-Chervonenkis dimension
Inform. and Comput.
(1991) Queries and concept learning
Machine Learning
(1988)- et al.
Learnability and the Vapnik-Chervonenkis dimension
J. ACM
(1989) The complexity of theorem-proving procedures
- et al.
A general lower bound on the number of examples needed for learning
Inform. and Comput.
(1989)
There are more references available in the full text version of this article.
Cited by (2)
A complete public-key cryptosystem
2009, Groups, Complexity, CryptologyUniversal semantic communication i
2008, Proceedings of the Annual ACM Symposium on Theory of Computing
- ☆
Presented in the Impromptu Session of COLT96.
- ∗
On sabbatical leave at LCS, MIT.
- 2
Research was supported in part by an NSF Postdoctoral Fellowship.
Copyright © 1997 Published by Elsevier B.V.