1. Learnability: Admissible, co-finite, and hypersimple sets;Baliga;J. Comput. System Sci.,1996
2. J. Barzdin, Two theorems on the limiting synthesis of functions, Theory of Algorithms and Programs, Latvian State University, Riga, 1974, 210, 82, 88
3. Toward a mathematical theory of inductive inference;Blum;Inform. and Control,1975
4. Problems in inductive inference;Case;Bull. Europ. Assoc. Theor. Comput. Sci.,1982
5. Infinitary self-reference in learning theory;Case;Journ. Exper. Theoret. Artif. Intell.,1994