Induction by enumeration

DOI10.1006/INCO.2001.2910zbMATH Open1005.68084OpenAlexW1969650680MaRDI QIDQ1854469FDOQ1854469

Authors: Éric Martin, Daniel N. Osherson 

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3f4189e0e55d9d4294d3e2d6fc3b9e469a6e3a6c

Recommendations

• On the role of search for learning from examples
• The problem of probabilistic justification of enumerative induction
• Modes of convergence to the truth: steps toward a better epistemology of induction
• A universal inductive inference machine
• The emergence of reasons conjecture.

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Language identification in the limit
• On the intrinsic complexity of learning
• The structure of intrinsic complexity of learning
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Title not available (Why is that?)
• On the complexity of inductive inference
• Title not available (Why is that?)
• Classification using information
• Classifying Predicates and Languages
• Ultraproducts of finite sets
• Title not available (Why is that?)

Cited In (4)

• Induction using term orders
• Title not available (Why is that?)
• On the role of search for learning from examples
• The problem of probabilistic justification of enumerative induction

This page was built for publication: Induction by enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854469)