|
 |
|
|
|
|
[93] ———, The intrinsic complexity of language identification, Journal of Computer and System Sciences 52 (1996), 393-402. |
|
|
|
|
|
|
|
|
[94] ———, Elementary formal systems, intrinsic complexity, and procrastination, Information and Computation 132 (1997), 65-84. |
|
|
|
|
|
|
|
|
[95] ———, The structure of intrinsic complexity of learning, Journal of Symbolic Logic 62 (1997), 1187-1201. |
|
|
|
|
|
|
|
|
[96] ———, Generalization and specialization strategies for learning r.e. languages, Annals of Mathematics and Artificial Intelligence (1998), to appear. |
|
|
|
|
|
|
|
|
[97] S. Jain, A. Sharma, and M. Velauthapillai, Finite identification of function by teams with success ratio 1/2 and above, Information and Computation 121 (1995), 201-213. |
|
|
|
|
|
|
|
|
[98] K. Jantke, Natural properties of strategies identifying recursive functions, Electronische Informationverarbeitung und Kybernetik 15 (1979), 487-496. |
|
|
|
|
|
|
|
|
[99] ———, Monotonic and non-monotonic inductive inference, New Generation Computing 8 (1991), 349-360. |
|
|
|
|
|
|
|
|
[100] K. Jantke and H. Beick, Combining postulates of naturalness in inductive inference, Electronische Informationverarbeitung und Kybernetik 17 (1981), 465-484. |
|
|
|
|
|
|
|
|
[101] C. Jockusch, Degrees of generic sets, Recursion Theory: Its generalizations and applications (F. Drake and S. Wainer, eds.), Cambridge University Press, 1980, pp. 110-139. |
|
|
|
|
|
|
|
|
[102] B. Kapron and S. Cook, A new characterization of type 2 feasibility, SIAM Journal of Computing 25 (1996), 117-132. |
|
|
|
|
|
|
|
|
[103] S. Kapur, Monotonic language learning, Algorithmic Learning Theory: Third International Workshop (ALT '92) (S. Doshita, K. Furukawa, K. Jantke, and T. Nishida, eds.), Lecture Notes in Artificial Intelligence, vol. 743, Springer-Verlag, 1992, pp. 147-158. |
|
|
|
|
|
|
|
|
[104] S. Kaufmann and F. Stephan, Robust learning with infinite additional information, Third European Conference on Computational Learning Theory (S. Ben-David, ed.), Lecture Notes in Artificial Intelligence, vol. 1208, Springer-Verlag, 1997, pp. 316-330. |
|
|
|
|
|
|
|
|
[105] M. Kearns and U. Vazirani, An Introduction to Computational Learning Theory, MIT Press, 1994. |
|
|
|
|
|
|
|
|
[106] E. Kinber, On a theory of inductive inference, Proceedings of the 1977 International Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 56, Springer-Verlag, 1977, pp. 435-440. |
|
|
|
|
|
|
|
|
[107] ———, On limit identification of minimal Gödel numbers for functions from enumerable classes, Theory of Algorithms and Programs, vol. 3, Latvian State University, 1977, pp. 35-56. |
|
|
|
|
