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
Prudence and other conditions on formal language learning
Information and Computation
On the role of procrastination in machine learning
Information and Computation
Characterizations of monotonic and dual monotonic language learning
Information and Computation
A Guided Tour Across the Boundaries of Learning Recursive Languages
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Reflecting and Self-Confident Inductive Inference Machines
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Reflecting Inductive Inference Machines and Its Improvement by Therapy
ALT '96 Proceedings of the 7th International Workshop on Algorithmic Learning Theory
Reflective Inductive Inference of Recursive Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
In this paper we study the question of whether identifiable classes have subclasses which are identifiable under a more restrictive criterion. The chosen framework is inductive inference, in particular the criterion of explanatory learning (Ex) of recursive functions as introduced by Gold [Inform. Comput. 10 (1967) 447]. Among the more restrictive criteria is finite learning where the learner outputs, on every function to be learned, exactly one hypothesis (which has to be correct). The topic of the present paper are the natural variants (a) and (b) below of the classical question whether a given learning criterion like finite learning is more restrictive than Ex-learning. (a) Does every infinite Ex-identifiable class have an infinite finitely identifiable subclass? (b) If an infinite Ex-identifiable class S has an infinite finitely identifiable subclass, does it necessarily follow that some appropriate learner Ex-identifies S as well as finitely identifies an infinite subclass of S? These questions are also treated in the context of ordinal mind change bounds.