Article PDF
Avoid common mistakes on your manuscript.
References
Angluin, D. (1987). Learning regular sets from queries and counterexamples.Information and Computation,75, 87–106.
Angluin, D. (1988). Queries and concept learning.Machine Learning,2, 319–342.
Gold, E.M. (1967). Language identification in the limit.Information and Control,10, 447–474.
Haussler, D. and Pitt, L. (Eds.) (1988).Proceedings of the 1988 Workshop on Computational Learning Theory. San Mateo, CA: Morgan Kaufmann.
Littlestone, N. (1987). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm.Machine Learning,2, 285–318.
Pitt, L. (1989). Inductive inference, DFAs, and computational complexity.Proceedings of AII-89 Workshop on Analogical and Inductive Inference;Lecture Notes in Artifical Intelligence 397, (pp. 18–44), Heidelberg: Springer-Verlag.
Rivest, R.L., Haussler, D. and Warmuth, M.K. (Eds.) (1989).Proceedings of the 1989 Workshop on Computational Learning Theory. San Mateo, CA: Morgan Kaufmann.
Salzberg, S. (1988).Exemplar-based learning: Theory and implementation. (Technical Report TR-10–88). Cambridge, MA: Harvard University, Center for Research in Computing Technology.
Valiant, L.G. (1984). A theory of the learnable.Communications of the ACM,27, 1134–1142.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pitt, L. Introduction: Special issue on computational learning theory. Mach Learn 5, 117–120 (1990). https://doi.org/10.1007/BF00116033
Issue Date:
DOI: https://doi.org/10.1007/BF00116033