Reference187 articles.
1. A. Ambainis, J. Case, S. Jain, and M. Surajm, Parsimony hierarchies for inductive inference, J. Symb. Log. 69 (2004), 287–328.
2. D. Angluin, W. Gasarch, and C. Smith, Training sequences, Theor. Comput. Sci. 66 (1989), no. 3, 255–272.
3. D. Angluin, Inductive inference of formal languages from positive data, Inf. Control 45 (1980), 117–135.
4. J. Bārzdiņš, Two theorems on the limiting synthesis of functions (in Russian), Theory of Algorithms and Programs, Riga, Latvian State Univ. 210 (1974), 82–88.
5. L. Blum and M. Blum, Toward a mathematical theory of inductive inference, Inf. Control 28 (1975), 125–155.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Necessity of U-Shaped Learning;Topics in Cognitive Science;2013-01
2. From Turing machines to computer viruses;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2012-07-28