# Training digraphs

Selected Papers Analogical and Inductive Inference

First Online:

## 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.

## Preview

Unable to display preview. Download preview PDF.

## References

- [1]D. Angluin, W.I. Gasarch, C.H. Smith,
*Training Sequences*, Theoretical Computer Science**66**(1989) pp. 255–272.Google Scholar - [2]D. Angluin, C.H. Smith,
*Inductive inference: theory and methods*, Computing Survey**15**(1983) pp. 237–269.Google Scholar - [3]J. Case and C. Smith,
*Comparison of identification criteria for machine inductive inference*, Theoretical Computer Science**25**(1983) pp. 193–220.Google Scholar - [4]N.J. Cutland,
*Computability: An introduction to recursive function theory*, Cambridge University Press (1980).Google Scholar - [5]R.P. Daley and C.H. Smith,
*On the complexity of inductive inference*, Information and Control**69**(1986) pp. 12–40.Google Scholar - [6]M.D. Davis, E.J. Weyuker,
*Computability, Complexity, and Languages*, Academic Press (1983).Google Scholar - [7]E.M. Gold,
*Language identification in the limit*, Information and Control**10**(1967) pp. 447–474.Google Scholar - [8]D.B. Lenat, E.A. Feigenbaum:
*On the thresholds of knowledge*, Artificial Intelligence**47**(1991) pp. 185–250.Google Scholar - [9]C.H. Papadimitriou, K. Steiglitz
*Combinatorial Optimization: Algorithms and Complexity*, Prentice Hall (1982).Google Scholar - [10]H. Rogers, Jr.,
*Theory of Recursive Functions and Effective Computability*, The MIT Press (1988).Google Scholar - [11]Robert I. Soare,
*Recursively Enumerable Sets and Degrees*, Springer-Verlag (1980).Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1994