On the learnability of recursively enumerable languages from good examples (Q5941366)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the learnability of recursively enumerable languages from good examples |
scientific article; zbMATH DE number 1635554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the learnability of recursively enumerable languages from good examples |
scientific article; zbMATH DE number 1635554 |
Statements
On the learnability of recursively enumerable languages from good examples (English)
0 references
20 August 2001
0 references
inductive inference
0 references
computational learning theory
0 references
good examples
0 references
0.9261953
0 references
0.9145895
0 references
0.9145895
0 references
0.89998215
0 references
0.86667776
0 references
0.86480236
0 references
0.8590789
0 references
