Aggregating inductive expertise

DOI10.1016/S0019-9958(86)80025-0zbMath0612.68077OpenAlexW1969335312MaRDI QIDQ3753515

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)

Related Items (12)

Counting extensional differences in BC-learning ⋮ Probability and plurality for aggregations of learning machines ⋮ On aggregating teams of learning machines ⋮ Paradigms of truth detection ⋮ Recursion theoretic models of learning: Some results and intuitions ⋮ On the relative sizes of learnable sets ⋮ Learning in the presence of partial explanations ⋮ Aggregating inductive expertise on partial recursive functions ⋮ Measure, category and learning theory ⋮ Robust learning is rich ⋮ Closedness properties in ex-identification ⋮ Automata techniques for query inference machines

This page was built for publication: Aggregating inductive expertise