Learnability

Learnability

oftware 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.

Frameworks include:
* Language identification in the limit proposed in 1967 by E. Mark Gold. [E.M. Gold. " [http://www.isrl.uiuc.edu/~amag/langev/paper/gold67limit.html Language identification in the limit] " Information and Control, 10(5), 1967.] Subsequently known as Algorithmic learning theory.
* Probably approximately correct learning (PAC learning) proposed in 1984 by Leslie ValiantL. Valiant. " [http://web.mit.edu/6.435/www/Valiant84.pdf A theory of the learnable.] " Communications of the ACM, 27, 1984.]

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • learnability — noun a) the condition of being learnable b) the ease with which something can be learned …   Wiktionary

  • learnability — learnabilˈity noun • • • Main Entry: ↑learn …   Useful english dictionary

  • Language identification in the limit — is a formal model for inductive inference. It was introduced by E. Mark Gold in his paper with the same title [http://www.isrl.uiuc.edu/ amag/langev/paper/gold67limit.html] . In this model, a learner is provided with presentation of some language …   Wikipedia

  • List of important publications in computer science — This is a list of important publications in computer science, organized by field. Some reasons why a particular publication might be regarded as important: Topic creator – A publication that created a new topic Breakthrough – A publication that… …   Wikipedia

  • Poverty of the stimulus — The poverty of the stimulus (POTS) argument is a variant of the epistemological problem of the indeterminacy of data to theory that claims that grammar is unlearnable given the linguistic data available to children. As such, the argument strikes… …   Wikipedia

  • Computational learning theory — In theoretical computer science, computational learning theory is a mathematical field related to the analysis of machine learning algorithms. Contents 1 Overview 2 See also 3 References 3.1 Surveys …   Wikipedia

  • writing — /ruy ting/, n. 1. the act of a person or thing that writes. 2. written form: to commit one s thoughts to writing. 3. that which is written; characters or matter written with a pen or the like: His writing is illegible. 4. such characters or… …   Universalium

  • Comparison between Esperanto and Interlingua — Esperanto and Interlingua are two planned languages which have taken radically different approaches to the problem of providing an International auxiliary language (IAL). Although they are both classed as IALs, the intellectual bases of Esperanto …   Wikipedia

  • Charles F. Hockett — Charles Francis Hockett Born January 17, 1916(1916 01 17) Columbus, Ohio, United States Died November 3, 2000( …   Wikipedia

  • Steven Pinker — Steven Arthur Pinker Steven Pinker in 2011 Born September 18, 1954 ( …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”