Learnability

Learnability is a quality of products and interfaces that allows users to quickly become familiar with them and able to make good use of all their features and capabilities

Software testing

In software testing learnability, according to ISO/IEC 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

Gold, E. Mark (1967). "Language identification in the limit" (PDF). Information and Control. 10 (5): 447–474. doi:10.1016/S0019-9958(67)91165-5.
Valiant, Leslie (Nov 1984). "A theory of the learnable" (PDF). Communications of the ACM. 27 (11): 1134–1142. doi:10.1145/1968.1972.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Gold, E. Mark (1967). "Language identification in the limit" (PDF). Information and Control. 10 (5): 447–474. doi:10.1016/S0019-9958(67)91165-5.

[valiant-2] Valiant, Leslie (Nov 1984). "A theory of the learnable" (PDF). Communications of the ACM. 27 (11): 1134–1142. doi:10.1145/1968.1972.