Humans appear to be able to learn new concepts without needing to be programmed explicitly in any conventional sense. In this paper we regard learning as the phenomenon of knowledge acquisition in the absence of explicit programming. We give a precise methodology for studying this phenomenon from a computational viewpoint. It consists of choosing an appropriate information gathering mechanism, the learning protocol, and exploring the class of concepts that can be learned using it in a reasonable (polynomial) number of steps. Although inherent algorithmic complexity appears to set serious limits to the range of concepts that can be learned, we show that there are some important nontrivial classes of propositional concepts that can be learned in a realistic sense.
[1]
Stephen A. Cook,et al.
The complexity of theorem-proving procedures
,
1971,
STOC.
[2]
Richard O. Duda,et al.
Pattern classification and scene analysis
,
1974,
A Wiley-Interscience publication.
[3]
Leslie G. Valiant,et al.
A complexity theory based on Boolean algebra
,
1981,
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[4]
Carl H. Smith,et al.
Inductive Inference: Theory and Methods
,
1983,
CSUR.
[5]
John R. Anderson,et al.
Machine learning - an artificial intelligence approach
,
1982,
Symbolic computation.
[6]
Silvio Micali,et al.
How to construct random functions
,
1986,
JACM.