Name
Abstract | ||
|---|---|---|
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar equivalence problem compared to acceptable numberings. We show that every explanatorily learnable class can be learnt in some Friedberg numbering. However, such a result does not hold for behaviourally correct learning or finite learning. One can also show that some Friedberg numberings are so restrictive that all classes which can be explanatorily learnt in such Friedberg numberings have only finitely many infinite languages. We also study similar questions for several properties of learners such as consistency, conservativeness, prudence, iterativeness and non-U-shaped learning. Besides Friedberg numberings, we also consider the above problems for programming systems with K-recursive grammar equivalence problem. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ic.2008.03.001 | Information & Computation |
Keywords | Field | DocType |
explanatorily learnt,friedberg numbering,explanatorily learnable class,acceptable numberings,friedberg numberings,k-recursive grammar equivalence problem,non-u-shaped learning,behaviourally correct learning,finite learning,special numberings | Numbering,Discrete mathematics,Computer science,Recursively enumerable language,Friedberg numbering,Grammar,Equivalence (measure theory),Artificial intelligence,Learnability,Machine learning | Journal |
Volume | Issue | ISSN |
206 | 6 | Information and Computation |
Citations | PageRank | References |
7 | 0.48 | 24 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjay Jain | 1 | 1647 | 177.87 |
| Frank Stephan | 2 | 215 | 39.36 |