On the learnability of recursively enumerable languages from good examples (Q5941366): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:43, 5 March 2024
scientific article; zbMATH DE number 1635554
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
