Learning by Erasing

Learning by erasing means the process of eliminating potential hypotheses from further consideration thereby converging to the least hypothesis never eliminated and this one must be a solution to the actual learning problem.

[1]  Martin Kummer.  A Learning-Theoretic Characterization of Classes of Recursive Functions , 1995, Inf. Process. Lett..

[2]  Rolf Wiehagen,et al.  Characterization Problems in the Theory of Inductive Inference , 1978, ICALP.

[3]  Carl H. Smith,et al.  Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions , 1994, AII/ALT.

[4]  Gianfranco Bilardi,et al.  Language Learning Without Overgeneralization , 1992, Theor. Comput. Sci..

[5]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[6]  Thomas Zeugmann,et al.  Characterizations of Monotonic and Dual Monotonic Language Learning , 1995, Inf. Comput..

[7]  John Case,et al.  Synthesizing enumeration techniques for language learning , 1996, COLT '96.

[8]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[9]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[10]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[11]  Carl H. Smith,et al.  Co-learning of total recursive functions , 1994, COLT '94.

[12]  Thomas Zeugmann,et al.  Types of monotonic language learning and their characterization , 1992, COLT '92.

[13]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[14]  Rusins Freivalds,et al.  Co-Learning of Recursive Languages from Positive Data , 1996, Ershov Memorial Conference.

[15]  Thomas Zeugmann,et al.  Learning Recursive Languages with Bounded Mind Changes , 1993, Int. J. Found. Comput. Sci..

[16]  Thomas Zeugmann,et al.  Language learning in dependence on the space of hypotheses , 1993, COLT '93.

[17]  Thomas Zeugmann,et al.  Characterization of language learning front informant under various monotonicity constraints , 1994, J. Exp. Theor. Artif. Intell..

[18]  V. Selivanov.  Enumerations of families of general recursive functions , 1976 .