1979 | | | **Finite identification of general recursive functions by probabilistic strategies** - *R. V. Freivalds* |

| | | **Inductive inference with additional information** - *R. V. Freivalds and R. Wiehagen* |

| | | **Mathematical learning theory: a formalized, axiomatic, abstract approach** - *R. J. Hendel* |

| | | **A class of functions synthesized from a finite number of examples and a LISP program scheme** - *Y. Kodratoff* |

| | | **Complexity of mechanized hypothesis formation** - *P. Pudlak and F. N. Springsteel* |

| | | **Formal Models of Language Learning** - *S. Pinker* |

| | | **Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings** - *D. Angluin and L. G. Valiant* |

| | | **Natural properties of strategies identifying recursive functions** - *K. P. Jantke* |

| | | **An inductive inference bibliography** - *C. H. Smith* |

| | | **Theorie der Zeichenerkennung** - *V. N. Vapnik* |

| | | **Automatic discovery of heuristics for nondeterministic programs** - *S. J. Stolfo and M. C. Harrison* |

| | | **Learning and generalization of characteristic descriptions: evaluation criteria and comparative review of selected methods** - *T. G. Dietterich and R. S. Michalski* |

| | | **LeistungsfÃ¤higkeit und Kompliziertheit universeller Verfahren zur Erkennung allgemein-rekursiver Funktionen** - *Klaus P. Jantke* |

| | | **Automatic Synthesis of Programs and Inductive Inference of Functions** - *K. Jantke* |

| | | **Inference of functions with an interactive system** - *J. P. Jouannaud and G. Guiho* |

| | | **Characterization of a class of functions synthesized by a Summers-like method using a B.M.W. matching technique** - *J. P. Jouannaud and Y. Kodratoff* |

| | | **Distribution-Free Performance Bounds with the Resubstitution Error Estimate** - *L. P. Devroye and T. J. Wagner* |

| | | **On the Principle Capabilities of Probabilistic Algorithms in Inductive Inference** - *R. Freivalds* |

| | | **Construction of natural language sentence acceptors by a supervised learning technique** - *D. Coulon and D. Kayser* |

| | | **Hierarchies of Identification Criteria for Mechanized Inductive Inference** - *C. H. Smith* |

| | | **Automatic Discovery Heuristics for Nondeterministic Programs From Sample Execution Traces** - *S. J. Stolfo* |

| | | **Refinements of inductive inference by Popperian machines** - *J. Case and S. Ngo-Manguelle* |

| January | | **Maryanski's Grammatical Inferencer** - *B. R. Gaines* |

| October | | **Capacity and Error Estimates for Boolean Classifiers with Limited Complexity** - *J. Pearl* |