 |
The introduction to this article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style. (October 2009) |
 |
This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (August 2007) |
Software testing
In software testing learnability, according to ISO 9126, is the capability of a software product to enable the user to learn how to use it. Learnability may be considered as an aspect of usability, and is of major concern in the design of complex software applications.
Learnability is defined in the Standard glossary of terms used in software testing published by the International Software Testing Qualifications Board.
Computational learning theory
In computational learning theory, learnability is the mathematical analysis of machine learning. It is also employed in language acquisition in arguments within linguistics.
Frameworks include:
- Language identification in the limit proposed in 1967 by E. Mark Gold.[1] Subsequently known as Algorithmic learning theory.
- Probably approximately correct learning (PAC learning) proposed in 1984 by Leslie Valiant[2]
References
- ^ E.M. Gold. Language identification in the limit Information and Control, 10(5), 1967.
- ^ L. Valiant. A theory of the learnable. Communications of the ACM, 27, 1984.
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
