L. G. Valiant
- 1 Angluin, D., Smith, C.H. Inductive inference: Theory and methods. Comput. Surv. 15, 3 (Sept. 1983), 237-269. Google Scholar
Digital Library
- 2 Barr, A., and Feigenbaum, E.A. The Handbook of Artificial Intelligence. Vol. 2. William Kaufmann, Los Altos, Calif., 1982.Google Scholar
- 3 Cook, S.A. The complexity of theorem proving procedures. In Proceedings of 3rd Annual ACM Symposium on Theory of Computing (Shaker Heights, Ohio, May 3-5). ACM, New York, 1971, 151-158. Google ScholarDigital Library
- 4 Duda, R.O., and Hart, P.F. Pattern Classification and Scene Analysis. Wiley, New York. 1973.Google Scholar
- 5 ErdSs, P., and Spencer, J. Probabilistic Methods in Combinatorics. Academic Press, New York, 1974.Google Scholar
- 6 Goldreich, O., Goldwasser, S., and Micali, S. How to construct random functions. In Proceedings of 25th IEEE Symposium on Foundations of Computer Science (Singer Island, Fla., Oct. 24-26). IEEE, New York, 1984.Google Scholar
- 7 Michalski, R.S. Carbonell, J.G., and Mitchell, T.M. Machine Learning: An Artificial Intelligence Approach. Tioga Publishing Co., Palo Alto, Calif., 1983. Google ScholarDigital Library
- 8 Skyum, S., and Valiant, L.G. A complexity theory based on Boolean algebra. In Proceedings of 22rid IEEE Symposium on Foundations of Computer Science (Nashville, Tenn., Oct. 28-30). IEEE, New York, 1981, 244-253.Google ScholarDigital Library
- 9 Valiant, L.G. Deductive learning. Philosophical Transactions of the Royal Society of London (1984). To be published.Google Scholar
Index Terms
- A theory of the learnable
Recommendations
From inductive inference to algorithmic learning theory
AbstractWe present two phenomena which were discovered in pure recursion-theoretic inductive inference, namely inconsistent learning (learing strategies producing apparently “senseless” hypotheses can solve problems unsolvable by “reasonable” learning ...
Non-U-shaped vacillatory and team learning
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science literature is occupied with how humans do it, for example, general rules ...
Quantum inductive inference by finite automata
Freivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19-29] proved that probabilistic limited memory inductive inference machines can learn with probability 1 ...
Comments