Kolmogorov Numberings and Minimal Identification
暂无分享,去创建一个
[1] Rusins Freivalds,et al. Inductive Inference of Recursive Functions: Qualitative Theory , 1991, Baltic Computer Science.
[2] Carl H. Smith,et al. Co-learning of total recursive functions , 1994, COLT '94.
[3] R. V. Freivald. Minimal Gödel Numbers and Their Identification in the Limit , 1975, MFCS.
[4] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[5] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[6] John Case,et al. Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..
[7] Rusins Freivalds,et al. Kolmogorov numberings and minimal identification , 1995, EuroCOLT.
[8] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..
[9] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[10] Keh-Jiann Chen,et al. Tradeoffs in machine inductive inference , 1981 .
[11] Keh-Jiann Chen. Tradeoffs in the Inductive Inference of Nearly Minimal Size Programs , 1982, Inf. Control..
[12] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .