1982 | | | **A Note on Formal Learning Theory** - *D. Osherson and S. Weinstein* |

| | | **Polynomial time inference of pattern languages and its applications** - *T. Shinohara* |

| | | **Learning Strategies** - *Daniel N. Osherson, Michael Stob and Scott Weinstein* |

| | | **Tradeoffs in the inductive inference of nearly minimal size programs** - *K. J. Chen* |

| | | **Criteria of Language Learning** - *Daniel N. Osherson and Scott Weinstein* |

| | | **Polynomial Time Inference of Extended Regular Pattern Languages** - *T. Shinohara* |

| | | **Zur Konvergenzgeschwindigkeit von Strategien der induktiven Inferenz** - *H. R. Beick* |

| | | **Machine Inductive Inference and Language Identification** - *J. Case and C. Lynes* |

| | | **On Extensional Learnability** - *K. Wexler* |

| | | **Problems in Inductive Inference** - *J. Case* |

| | | **A survey of the synthesis of LISP programs from examples** - *D. R. Smith* |

| | | **The use of tree derivatives and a sample support parameter for inferring tree systems** - *B. Levine* |

| | | **The Power of Pluralism for Automatic Program Synthesis** - *Carl H. Smith* |

| | | **A note on the number of queries needed to identify regular languages** - *D. Angluin* |

| | | **Generalization as search** - *T. M. Mitchell* |

| | | **Estimation of Dependences Based on Empirical Data** - *V. N. Vapnik* |

| | | **Ideal learning machines** - *D. Osherson, M. Stob and S. Weinstein* |

| | | **Learning and inductive inference** - *T. G. Dietterich, R. L. London, K. Clarkson and G. Dromey* |

| | | **Inductive Inference and Computable One-one Numberings** - *R. Freivalds, E. B. Kinber and R. Wiehagen* |

| April | | **Neural networks and physical systems with emergent collective computational abilities** - *J. J. Hopfield* |

| July | | **Inference of Reversible Languages** - *Dana Angluin* |