Mitotic Classes in Inductive Inference
暂无分享,去创建一个
[1] Rolf Wiehagen,et al. Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations , 2000, J. Comput. Syst. Sci..
[2] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[3] Carl H. Smith,et al. On the Intrinsic Complexity of Learning , 1995, Inf. Comput..
[4] Emil L. Post. Recursively enumerable sets of positive integers and their decision problems , 1944 .
[5] Carl H. Smith,et al. Classifying Predicates and Languages , 1997, Int. J. Found. Comput. Sci..
[6] G. Sacks. ON THE DEGREES LESS THAN 0 , 1963 .
[7] Christian Glaßer,et al. Autoreducibility, Mitoticity, and Immunity , 2005, MFCS.
[8] Richard E. Ladner,et al. Mitotic recursively enumerable sets , 1973, Journal of Symbolic Logic.
[9] Klaus Ambos-Spies. P-mitotic sets , 1983, Logic and Machines.
[10] R. Soare. Recursively enumerable sets and degrees , 1987 .
[11] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..
[12] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[13] Daniel N. Osherson,et al. Criteria of Language Learning , 1982, Inf. Control..
[14] Mark A. Fulk. Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..
[15] Arun Sharma,et al. The Intrinsic Complexity of Language Identification , 1996, J. Comput. Syst. Sci..
[16] Christian Glaßer,et al. Mitosis in Computational Complexity , 2006, TAMC.
[17] P. Odifreddi. Classical recursion theory , 1989 .
[18] Arun Sharma,et al. The Structure of Intrinsic Complexity of Learning , 1997, J. Symb. Log..
[19] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..