Name
Abstract | ||
|---|---|---|
Investigated is algorithmic learning, in the limit, of correct programs forrecursive functions f from both input/output examples of f and several interestingvarieties of approximate additional (algorithmic) information aboutf . Specifically considered, as such approximate additional information aboutf , are Rose's frequency computations for f and several natural generalizationsfrom the literature, each generalization involving programs for restricted treesof recursive functions... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1006/jcss.1997.1508 | Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995 |
Keywords | DocType | Volume |
recursive function,input output | Conference | 55 |
Issue | ISSN | Citations |
1 | 0022-0000 | 17 |
PageRank | References | Authors |
0.79 | 22 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Case | 1 | 138 | 7.06 |
| Susanne Kaufmann | 2 | 45 | 2.91 |
| Efim Kinber | 3 | 421 | 44.95 |
| Martin Kummer | 4 | 115 | 7.55 |