Name
Abstract | ||
|---|---|---|
In this paper we show that there exist classes of functions which can be learnt by a finite learner which reflects on its capability, but not learnable by a consistent learner which optimistically reflects on its capability. This solves the two mentioned open problems from [G. Grieser, Reflective inductive inference of recursive functions, Theoretical Computer Science A 397 (1-3) (2008) 57-69 (Special Issue on Forty Years of Inductive Inference. Dedicated to the 60th Birthday of Rolf Wiehagen)]. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ipl.2008.10.006 | Inf. Process. Lett. |
Keywords | Field | DocType |
rolf wiehagen,reflection,open problem,theory of computation,consistent learner,forty years,inductive inference,finite learner,special issue,consistency.,recursive function,reflective inductive inference,g. grieser,theoretical computer science a,consistency | Inductive reasoning,Computer science,Theoretical computer science,Recursive functions,Theory of computation | Journal |
Volume | Issue | ISSN |
109 | 3 | 0020-0190 |
Citations | PageRank | References |
1 | 0.35 | 12 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjay Jain | 1 | 1647 | 177.87 |