Abstract
This paper deals with the ability of cooperating teams of learners to learn classes of total recursive functions. The main contribution of the research described here is the development of analytical tools which permit the determination of team learning capabilities. The basis of our analytical framework is a reduction technique. We extend the notion of finite learning in order to successfully apply the reduction technique.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Daley, and B. Kalyanasundaram, Capabilities of Probabilistic Learners with Bounded Mind Changes, In Proceedings of the 1993 Workshop on Computational Learning Theory, 1993.
R. Daley, and B. Kalyanasundaram, Use of Reduction Arguments in Determining Popperian FIN-type Learning Capabilities, In Proceedings of the 1993 Workshop on Algorithmic Learning Theory, 1993.
R. Daley, B. Kalyanasundaram, and M. Velauthapillai, Breaking the probability 1/2 barrier in FIN-type learning, In Proceedings of the 1992 Workshop on Computational Learning Theory, 1992.
R. Daley, B. Kalyanasundaram, and M. Velauthapillai, The Power of Probabilism in Popperian FINite Learning, In Proceedings of the 1992 Workshop on Analogical and Inductive Inference, Lecture Notes in Computer Science 642, 151–169.
R. Daley, L. Pitt, M. Velauthapillai, and T. Will, Relations between probabilistic and team one-shot learners, In Proceedings of the 1991 Workshop on Computational Learning Theory, pages 228–239, 1991.
R.V. Freivalds, Finite Identification of General Recursive Functions by Probabilistic Strategies, Akademie Verlag, Berlin, 1979.
S. Jain, and A. Sharma, Finite learning by a team, In Proceedings of the 1990 Workshop on Computational Learning Theory, pages 163–177, 1990.
D. Osherson, M. Stob, and S. Weinstein, Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists, MIT Press, Cambridge, Mass., 1986.
L. Pitt, and C. Smith, Probability and plurality for aggregations of learning machines, Information and Computation, 77(1):77–92, 1988.
M. Velauthapillai, Inductive inference with a bounded number of mind changes, In Proceedings of the 1989 Workshop on Computational Learning Theory, pages 200–213, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Daley, R., Kalyanasundaram, B. (1995). Towards reduction arguments for FINite learning. In: Jantke, K.P., Lange, S. (eds) Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Computer Science, vol 961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60217-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-60217-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60217-0
Online ISBN: 978-3-540-44737-5
eBook Packages: Springer Book Archive