Abstract
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Uniform learning is concerned with the design of single programs solving infinitely many classical learning problems. For that purpose the program reads a description of an identification problem and is supposed to construct a technique for solving the particular problem.
As can be proved, uniform solvability of collections of solvable identification problems is rather influenced by the description of the problems than by the particular problems themselves. When prescribing a specific inference criterion (for example learning in the limit), a clever choice of descriptions allows uniform solvability of all solvable problems, whereas even the most simple classes of recursive functions are not uniformly learnable without restricting the set of possible descriptions. Furthermore the influence of the hypothesis spaces on uniform learnability is analysed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.; Inductive Inference of Formal Languages from Positive Data, Information and Control 45, 117–135 (1980).
Barzdins, J.; Two Theorems on the Limiting Synthesis of Functions, Theory of Algorithms and Programs, Latvian State University, Riga 210, 82–88 (1974) (in Russian).
Barzdins, J.; Inductive Inference of Automata, Functions and Programs, In: Proceedings International Congress of Math., Vancouver, 455–460 (1974).
Baliga, G.; Case, J.; Jain, S.; Synthesizing Enumeration Techniques for Language Learning, In: Proceedings of the Ninth Annual Conference on Computational Learning Theory, ACM Press, 169–180 (1996).
Case, J.; Smith, C.; Comparison of Identification Criteria for Machine Inductive Inference, Theoretical Computer Science 25, 193–220 (1983).
Gold, E.M.; Language Identification in the Limit, Information and Control 10, 447–474 (1967).
Jantke, K.; Natural Properties of Strategies Identifying Recursive Functions, Elektronische Informationsverarbeitung und Kybernetik 15, 487–496 (1979).
Jantke, K.; Beick, H.; Combining Postulates of Naturalness in Inductive Inference, Elektronische Informationsverarbeitung und Kybernetik 17, 465–484 (1981).
Kapur, S.; Bilardi, G.; On uniform learnability of language families, Information Processing Letters 44, 35–38 (1992).
Osherson, D.N.; Stob, M.; Weinstein, S.; Synthesizing Inductive Expertise, Information and Computation 77, 138–161 (1988).
Oymanns, L.; Lernen von rekursiven Funktionen mit guten Beispielen, Diploma Thesis, University of Kaiserslautern (1998) (in German).
Rogers, H.; Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge, Massachusetts (1987).
Wiehagen, R.; Zur Theorie der algorithmischen Erkennung, Dissertation B, Humboldt-University, Berlin (1978) (in German).
Zilles, S.; On Uniform Learning of Classes of Recursive Functions, Technical Report LSA-2000-05E, Centre for Learning Systems and Applications, University of Kaiserslautern (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zilles, S. (2001). On the Synthesis of Strategies Identifying Recursive Functions. In: Helmbold, D., Williamson, B. (eds) Computational Learning Theory. COLT 2001. Lecture Notes in Computer Science(), vol 2111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44581-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-44581-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42343-0
Online ISBN: 978-3-540-44581-4
eBook Packages: Springer Book Archive