Aggregating inductive expertise

DOI10.1016/S0019-9958(86)80025-0MaRDI QIDQ3753515zbMATH OpenOpenAlexFDO

Authors Michael Stob, Scott Weinstein, Daniel N. Osherson

Publication date 1986

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(86)80025-0

zbMATH Keywords

aggregation probleminductive inference machinesinferential agent

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Applications of computability and recursion theory (03D80)

Recommendations

• Aggregating inductive expertise on partial recursive functions
• Probabilistic inductive inference
• scientific article; zbMATH DE number 4058896
• Probability and plurality for aggregations of learning machines
• Synthesizing inductive expertise

Cited in

(14)

• Learning in the presence of partial explanations
• Aggregating inductive expertise on partial recursive functions
• Automata techniques for query inference machines
• Recursion theoretic models of learning: Some results and intuitions
• Paradigms of truth detection
• Counting extensional differences in BC-learning
• Measure, category and learning theory
• Synthesizing inductive expertise
• Robust learning is rich
• Probability and plurality for aggregations of learning machines
• Closedness properties in ex-identification
• On the relative sizes of learnable sets
• On aggregating teams of learning machines
• scientific article; zbMATH DE number 4058896 (Why is no real title available?)

This page was built for publication: Aggregating inductive expertise

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