Teachability in computational learning (Q749233): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence of models for polynomial learnability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for combinatorial problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational limitations on learning from examples / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theory of the learnable / rank | |||
Normal rank |
Latest revision as of 11:14, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Teachability in computational learning |
scientific article |
Statements
Teachability in computational learning (English)
0 references
1991
0 references
teaching
0 references
PAC-learning
0 references
computational complexity
0 references
computational learning
0 references