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.

• Publication year

  1999

• Venue

  Theoretical Computer Science

• Publication date

  1999-02-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0304-3975(00)00218-8arXiv cs/9902026
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Probabilistic and team PFIN-type learning: general properties

  2005influential reference
• Hierarchies of probabilistic and team FIN-learning

  2001cited by this paper
• BOOK REVIEW: "SYSTEMS THAT LEARN: AN INTRODUCTION TO LEARNING THEORY, SECOND EDITION", SANJAY JAIN, DANIEL OSHERSON, JAMES S. ROYER and ARUN SHARMA

  2001cited by this paper
• Hierarchies of probabilistic and team learning

  1998cited by this paper
• Asymmetric team learning

  1997influential reference
• FINite learning capabilities and their limits

  1997cited by this paper
• Team Learning as a Game

  1997cited by this paper
• Computational Limits on Team Identification of Languages

  1996cited by this paper
• Probabilitic Limit Identification up to "Small" Sets

  1996cited by this paper
• Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above

  1995cited by this paper
• On Identification by Teams and Probabilistic Machines

  1995cited by this paper
• Towards Reduction Argumentf for FINite Learning

  1995cited by this paper
• Probabilistic Language Learning Under Monotonicity Constraints

  1995cited by this paper
• Breaking the Probability 1/2 Barrier in FIN-Type Learning

  1995cited by this paper
• Three Decades of Team Learning

  1994cited by this paper
• An Introduction to Computational Learning Theory

  1994cited by this paper
• Extremes in the Degrees of Inferability

  1994cited by this paper
• The strength of noninclusions for teams of finite learners (extended abstract)

  1994influential reference
• The power of probabilism in Popperian FINite learning

  1994cited by this paper
• Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities

  1993influential reference
• On the structure of degrees of inferability

  1993cited by this paper
• Breaking the probability ½ barrier in FIN-type learning

  1992cited by this paper
• The Power of Probabilism in Popperian FINite Learning (extended abstract)

  1992cited by this paper
• Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists

  1990cited by this paper
• Degrees of Functions with no Fixed Points

  1989cited by this paper
• Probabilistic inductive inference

  1989cited by this paper
• Classical recursion theory

  1989influential reference
• Probability and Plurality for Aggregations of Learning Machines

  1987cited by this paper
• A theory of the learnable

  1984cited by this paper
• Inductive Inference: Theory and Methods

  1983cited by this paper
• The Power of Pluralism for Automatic Program Synthesis

  1982cited by this paper
• An introduction to the general theory of algorithms

  1978cited by this paper
• Some Natural Properties of Strong-Identification in Inductive Inference

  1976cited by this paper
• Theory of Recursive Functions and Effective Computability.

  1969cited by this paper
• Theory of Recursive Functions and Effective Computability

  1969cited by this paper
• Language Identification in the Limit

  1967influential reference
• On notation for ordinal numbers

  1938cited by this paper
• Towards Reduction Arguments for FINite Learning

  year unknowncited by this paper

• Ingredients for Responsible Machine Learning: A Commented Review of The Hitchhiker’s Guide to Responsible Machine Learning

  2022cites this paper
• Equivalences between learning of data and probability distributions, and their applications

  2018cites this paper
• Ju l 2 01 8 Equivalences between learning of data and probability distributions , and their applications ∗

  2018cites this paper
• Algorithmic learning of probability distributions from random data in the limit

  2017cites this paper
• On the Influence of Technology on Learning Processes

  2014cites this paper
• Learning from Streams

  2009influential citation
• Learning recursive functions: A survey

  2008cites this paper
• Learning Recursive Functions by Thomas Zeugmann and Sandra Zilles Division of Computer Science Report Series A November

  2007cites this paper
• Absolute versus probabilistic classification in a logical setting

  2005cites this paper