Numberings Optimal for Learning
暂无分享,去创建一个
[1] Richard M. Friedberg,et al. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.
[2] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.
[3] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[4] Rolf Wiehagen,et al. Learning and Consistency , 1995, GOSLER Final Report.
[5] Thomas Zeugmann,et al. Language learning in dependence on the space of hypotheses , 1993, COLT '93.
[6] Daniel N. Osherson,et al. Criteria of Language Learning , 1982, Inf. Control..
[7] Mark A. Fulk. Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..
[8] Arun Sharma,et al. Learning with the Knowledge of an Upper Bound on Program Size , 1993, Inf. Comput..
[9] R. Soare. Recursively enumerable sets and degrees , 1987 .
[10] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[11] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..
[12] John Case,et al. The Power of Vacillation in Language Learning , 1999, SIAM J. Comput..
[13] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[14] Dick de Jongh,et al. Angluin's theorem for indexed families of r.e. sets and applications , 1996, COLT '96.
[15] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.
[16] John Case,et al. Control structures in hypothesis spaces: the influence on learning , 2002, Theor. Comput. Sci..
[17] Sandra Zilles,et al. Increasing the power of uniform inductive learners , 2005, J. Comput. Syst. Sci..
[18] Sanjay Jain,et al. Learning in Friedberg Numberings , 2007, ALT.
[19] Sandra Zilles. Separation of uniform learning classes , 2004, Theor. Comput. Sci..
[20] Rolf Wiehagen,et al. Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen , 1976, J. Inf. Process. Cybern..
[21] Rusins Freivalds,et al. Inductive Inference and Computable One-One Numberings , 1982, Math. Log. Q..