Abstract
A formal definition of what it means for a machine to learn a collection of concepts in an order determined by a finite acyclic digraph of recursive functions is presented. We show that given a labelled graph G=(V, E) representing the learning structure, there are sets S such that in order to learn a program corresponding to some node i, a machine must have precisely learned programs corresponding to all the predecessor nodes.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin, W.I. Gasarch, C.H. Smith, Training Sequences, Theoretical Computer Science 66 (1989) pp. 255–272.
D. Angluin, C.H. Smith, Inductive inference: theory and methods, Computing Survey 15 (1983) pp. 237–269.
J. Case and C. Smith, Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25 (1983) pp. 193–220.
N.J. Cutland, Computability: An introduction to recursive function theory, Cambridge University Press (1980).
R.P. Daley and C.H. Smith, On the complexity of inductive inference, Information and Control 69 (1986) pp. 12–40.
M.D. Davis, E.J. Weyuker, Computability, Complexity, and Languages, Academic Press (1983).
E.M. Gold, Language identification in the limit, Information and Control 10 (1967) pp. 447–474.
D.B. Lenat, E.A. Feigenbaum: On the thresholds of knowledge, Artificial Intelligence 47 (1991) pp. 185–250.
C.H. Papadimitriou, K. Steiglitz Combinatorial Optimization: Algorithms and Complexity, Prentice Hall (1982).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, The MIT Press (1988).
Robert I. Soare, Recursively Enumerable Sets and Degrees, Springer-Verlag (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tu, HC., Smith, C.H. (1994). Training digraphs. In: Arikawa, S., Jantke, K.P. (eds) Algorithmic Learning Theory. AII ALT 1994 1994. Lecture Notes in Computer Science, vol 872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58520-6_63
Download citation
DOI: https://doi.org/10.1007/3-540-58520-6_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58520-6
Online ISBN: 978-3-540-49030-2
eBook Packages: Springer Book Archive