|
 |
|
|
|
|
[49]. ———, Use of reduction arguments in determining Popperian FIN-type learning capabilities, Algorithmic Learning Theory: Fourth International Workshop (ALT '93) (K. Jantke, S. Kobayashi, E. Tomita, and T. Yokomori, eds.), Lecture Notes in Artificial Intelligence, vol. 744, Springer-Verlag, 1993, pp. 173-186. |
|
|
|
|
|
|
|
|
[50] R. Daley, B. Kalyanasundaram, and M. Velauthapillai, Breaking the probability 1/2 barrier in FIN-type learning, Proceedings of the Fifth Annual Workshop on Computational Learning Theory, ACM Press, 1992, pp. 203-217. |
|
|
|
|
|
|
|
|
[51] ———, The power of probabilism in Popperian finite learning, Analogical and Inductive Inference, Proceedings of the Third International Workshop, Lecture Notes in Artificial Intelligence, vol. 642, Springer-Verlag, 1992, pp. 151-169. |
|
|
|
|
|
|
|
|
[52] ———, Capabilities o f fallible finite learning, Proceedings of the Sixth Annual Conference on Computational Learning Theory, ACM Press, 1993, pp. 199-208. |
|
|
|
|
|
|
|
|
[53] R. Daley, L. Pitt, M. Velauthapillai, and T. Will, Relations between probabilistic and team one-shot learners, Proceedings of the Fourth Annual Workshop on Computational Learning Theory (L. Valiant and M. Warmuth, eds.), Morgan Kaufmann, 1991, pp. 228-239. |
|
|
|
|
|
|
|
|
[54] R. Daley and C. Smith, On the complexity of inductive inference, Information and Control 69 (1986), 12-40. |
|
|
|
|
|
|
|
|
[55] M. Demetras, K. Post, and C. Snow, Feedback to first language learners: The role of repetitions and clarification questions, Journal of Child Language 13 (1986), 275-292. |
|
|
|
|
|
|
|
|
[56] R. Dudley, Real analysis, Wadsworth & Brooks/Cole, 1989. |
|
|
|
|
|
|
|
|
[57] H. Feldman, S. Goldin-Meadow, and L. Gleitman, Beyond Herotodus: The creation of language by linguistically deprived deaf children, Action, Symbol and Gesture: The Emergence of Language (A. Lock, ed.), Academic Press, 1978. |
|
|
|
|
|
|
|
|
[58] J. Feldman, Some decidability results on grammatical inference and complexity, Information and Control 20 (1972), 244-262. |
|
|
|
|
|
|
|
|
[59] L. Fortnow, W. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkoch, T. Slaman, R. Solovay, and F. Stephan, Extremes in the degrees of inferability, Annals of Pure and Applied Logic 66 (1994), 231-276. |
|
|
|
|
|
|
|
|
[60] R. Freivalds, Functions computable in the limit by probabilistic machines, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 28, Springer-Verlag, 1974, pp. 77-87. |
|
|
|
|
|
|
|
|
[61] ———, Minimal Gödel numbers and their identification in the limit, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 32, Springer-Verlag, 1975, pp. 219-225. |
|
|
|
|
