Convergence to nearly minimal size grammars by vacillating learning machines
暂无分享,去创建一个
[1] R. V. Freivald. Minimal Gödel Numbers and Their Identification in the Limit , 1975, MFCS.
[2] Gregory A. Riccardi. The Independence of Control Structures in Abstract Programming Systems , 1981, J. Comput. Syst. Sci..
[3] K. Wexler. On extensional learnability , 1982, Cognition.
[4] Efim B. Kinber,et al. On a Theory of Inductive Inference , 1977, FCT.
[5] Keh-Jiann Chen,et al. Tradeoffs in machine inductive inference , 1981 .
[6] Keh-Jiann Chen. Tradeoffs in the Inductive Inference of Nearly Minimal Size Programs , 1982, Inf. Control..
[7] John Case,et al. Machine Inductive Inference and Language Identification , 1982, ICALP.
[8] S. Pinker. Formal models of language learning , 1979, Cognition.
[9] Hartley Rogers,et al. Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.
[10] Mark A. Fulk. A study of inductive inference machines , 1986 .
[11] John Case,et al. Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..
[12] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[13] James S. Royer. A Connotational Theory of Program Structure , 1987, Lecture Notes in Computer Science.
[14] John Case. The power of vacillation , 1988, COLT '88.
[15] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[16] John Case,et al. Anomaly hierarchies of mechanized inductive inference , 1978, STOC.
[17] Ya. M. Barzdin,et al. Towards a Theory of Inductive Inference (in Russian) , 1973, MFCS.
[18] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..