Input-Dependence in Function-Learning
暂无分享,去创建一个
[1] Robert I. Soare,et al. Recursively enumerable sets and degrees - a study of computable functions and computability generated sets , 1987, Perspectives in mathematical logic.
[2] R. Soare. Recursively enumerable sets and degrees , 1987 .
[3] Arun Sharma,et al. On the Non-Existence of Maximal Inference Degrees for Language Identification , 1993, Inf. Process. Lett..
[4] Arun Sharma,et al. Computational Limits on Team Identification of Languages , 1996, Inf. Comput..
[5] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[6] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[7] Stuart A. Kurtz,et al. Extremes in the Degrees of Inferability , 1994, Ann. Pure Appl. Log..
[8] Mark A. Fulk. Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..
[9] P. Odifreddi. Classical recursion theory , 1989 .
[10] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..
[11] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969 .
[12] Manuel Blum,et al. Inductive inference and unsolvability , 1991, Journal of Symbolic Logic.
[13] Carl H. Smith,et al. Probability and Plurality for Aggregations of Learning Machines , 1987, Inf. Comput..
[14] Frank Stephan,et al. On the structure of degrees of inferability , 1993, COLT '93.
[15] Rolf Wiehagen,et al. Inductive Inference with Additional Information , 1979, J. Inf. Process. Cybern..
[16] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..