Systems that learn: an introduction to learning theory for cognitive and computer scientists
Systems that learn: an introduction to learning theory for cognitive and computer scientists
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Inductive Inference Machines That Can Refute Hypothesis Spaces
ALT '93 Proceedings of the 4th International Workshop on Algorithmic Learning Theory
Reflecting and Self-Confident Inductive Inference Machines
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Learning recursive functions: A survey
Theoretical Computer Science
Reflective inductive inference of recursive functions
Theoretical Computer Science
| Hi-index | 0.89 |
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)].