Probabilistic inductive inference: a survey

This paper surveys developments in probabilistic inductive inference (learning) of recursive (computable) functions. We mainly focus on finite learning, since this simple paradigm has produced the most interesting (and most complex) results.

[1]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[2]  Arun Sharma,et al.  On Identification by Teams and Probabilistic Machines , 1995, GOSLER Final Report.

[3]  Frank Stephan,et al.  On the structure of degrees of inferability , 1993, COLT '93.

[4]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

[5]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[6]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[7]  Robert H. Sloan,et al.  BOOK REVIEW: "SYSTEMS THAT LEARN: AN INTRODUCTION TO LEARNING THEORY, SECOND EDITION", SANJAY JAIN, DANIEL OSHERSON, JAMES S. ROYER and ARUN SHARMA , 2001 .

[8]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[9]  Bala Kalyanasundaram,et al.  Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities , 1993, ALT.

[10]  Kalvis Apsitis,et al.  Hierarchies of probabilistic and team learning , 1998 .

[11]  Carl H. Smith,et al.  Team Learning as a Game , 1997, ALT.

[12]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[13]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[14]  Stuart A. Kurtz,et al.  Extremes in the Degrees of Inferability , 1994, Ann. Pure Appl. Log..

[15]  Carl H. Smith,et al.  The Power of Pluralism for Automatic Program Synthesis , 1982, JACM.

[16]  Leonard Pitt,et al.  Probabilistic inductive inference , 1989, JACM.

[17]  Bala Kalyanasundaram,et al.  The power of probabilism in Popperian FINite learning , 1994, J. Exp. Theor. Artif. Intell..

[18]  Bala Kalyanasundaram,et al.  Breaking the probability ½ barrier in FIN-type learning , 1992, COLT '92.

[19]  Carl G. Jockusch,et al.  Degrees of Functions with no Fixed Points , 1989 .

[20]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[21]  Bala Kalyanasundaram,et al.  Breaking the Probability 1/2 Barrier in FIN-Type Learning , 1995, J. Comput. Syst. Sci..

[22]  Andris Ambainis.  Probabilistic and team PFIN-type learning: general properties , 1996, COLT '96.

[23]  Arun Sharma,et al.  Computational Limits on Team Identification of Languages , 1996, Inf. Comput..

[24]  Towards Reduction Arguments for FINite Learning , .

[25]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[26]  Juris Viksna.  Probabilitic Limit Identification up to "Small" Sets , 1996, ALT.

[27]  Carl H. Smith,et al.  Asymmetric team learning , 1997, COLT '97.

[28]  Bala Kalyanasundaram,et al.  Towards Reduction Argumentf for FINite Learning , 1995, GOSLER Final Report.

[29]  P. Odifreddi.  Classical recursion theory , 1989 .

[30]  Bala Kalyanasundaram,et al.  FINite learning capabilities and their limits , 1997, COLT '97.

[31]  Eliana Minicozzi,et al.  Some Natural Properties of Strong-Identification in Inductive Inference , 1976, Theor. Comput. Sci..

[32]  Carl H. Smith,et al.  Hierarchies of probabilistic and team FIN-learning , 2001, Theor. Comput. Sci..

[33]  Arun Sharma,et al.  Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above , 1995, Inf. Comput..

[34]  Bala Kalyanasundaram,et al.  The Power of Probabilism in Popperian FINite Learning (extended abstract) , 1992, AII.

[35]  Carl H. Smith,et al.  Probability and Plurality for Aggregations of Learning Machines , 1987, Inf. Comput..

[36]  Martin Kummer,et al.  The strength of noninclusions for teams of finite learners (extended abstract) , 1994, COLT '94.

[37]  Carl H. Smith,et al.  Three Decades of Team Learning , 1994, AII/ALT.

[38]  Léa Meyer,et al.  Probabilistic Language Learning Under Monotonicity Constraints , 1995, Theor. Comput. Sci..