On the relative sizes of learnable sets

DOI10.1016/S0304-3975(97)00175-8zbMath0902.68159MaRDI QIDQ1128667

Martin Kummer, Stuart A. Kurtz, William I. Gasarch, Rūsiņš Freivalds, Lance J. Fortnow

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

categorymeasureinductive inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Absolutely no free lunches! ⋮ Absolute versus probabilistic classification in a logical setting ⋮ Robust learning with infinite additional information

Cites Work

• Comparison of identification criteria for machine inductive inference
• Probability and plurality for aggregations of learning machines
• Almost everywhere high nonuniform complexity
• Learnability and the Vapnik-Chervonenkis dimension
• Aggregating inductive expertise
• Probabilistic inductive inference
• THE BANACH-MAZUR GAME
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the relative sizes of learnable sets