Name
Abstract | ||
|---|---|---|
This paper investigates some delicate tradeoffs between the generality of an algorithmic learning device and the quality of the programs it learns successfully. There are results to the effect that, thanks to small increases in generality of a learning device, the computational complexity of some successfully learned programs is provably unalterably suboptimal. There are also results in which the complexity of successfully learned programs is asymptotically optimal and the learning device is general, but, still thanks to the generality, some of those optimal, learned programs are provably unalterably information deficient—in some cases, deficient as to safe, algorithmic extractability/provability of the fact that they are even approximately optimal. For these results, the safe, algorithmic methods of information extraction will be by proofs in arbitrary, true, computably axiomatizable extensions of Peano Arithmetic. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/j.apal.2005.06.013 | Annals of Pure and Applied Logic |
Keywords | DocType | Volume |
Computational learning theory,Applications of computability theory | Conference | 139 |
Issue | ISSN | Citations |
1 | 0168-0072 | 1 |
PageRank | References | Authors |
0.35 | 18 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Case | 1 | 239 | 21.40 |
| Keh-Jiann Chen | 2 | 761 | 131.86 |
| Sanjay Jain | 3 | 1647 | 177.87 |
| Wolfgang Merkle | 4 | 167 | 18.46 |
| James S. Royer | 5 | 180 | 21.14 |