Effectivity Questions for Kleene's Recursion Theorem
暂无分享,去创建一个
[1] John Case,et al. Program Self-Reference in Constructive Scott Subdomains , 2009, Theory of Computing Systems.
[2] John Case,et al. Control Structures in Hypothesis Spaces: The Influence on Learning , 1997, EuroCOLT.
[3] Stephen Cole Kleene,et al. On notation for ordinal numbers , 1938, Journal of Symbolic Logic.
[4] Rózsa Péter. Review: S. C. Kleene, On Notation for Ordinal Numbers , 1939 .
[5] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[6] Samuel E. Moelius,et al. Program self-reference , 2009 .
[7] A. Nies. Computability and randomness , 2009 .
[8] John Case,et al. Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..
[9] Sanjay Jain. Hypothesis spaces for learning , 2011, Inf. Comput..
[10] James S. Royer. A Connotational Theory of Program Structure , 1987, Lecture Notes in Computer Science.
[11] Gregory A. Riccardi. The Independence of Control Structures in Abstract Programming Systems , 1981, J. Comput. Syst. Sci..
[12] Daniel N. Osherson,et al. Criteria of Language Learning , 1982, Inf. Control..
[13] Sanjay Jain,et al. Numberings optimal for learning , 2010, J. Comput. Syst. Sci..
[14] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[15] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.
[16] John Case,et al. The Power of Vacillation in Language Learning , 1999, SIAM J. Comput..