Trees and learning

DOI10.1016/J.JCSS.2003.08.001zbMath1072.68092OpenAlexW2088052622MaRDI QIDQ1878683

Wolfgang Merkle, Frank Stephan

Publication date: 8 September 2004

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2003.08.001

zbMATH Keywords

team learningEX-learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Learning algebraic structures with the help of Borel equivalence relations ⋮ Learning families of algebraic structures from informant ⋮ Robust learning with infinite additional information ⋮ Calculating the mind change complexity of learning algebraic structures

Cites Work

• Comparison of identification criteria for machine inductive inference
• Towards a mathematical theory of machine discovery from facts
• On the structure of degrees of inferability.
• Probability and plurality for aggregations of learning machines
• Classical recursion theory. The theory of functions and sets of natural numbers
• Some natural properties of strong-identification in inductive inference
• Classical recursion theory. Vol. II
• Learning recursive functions from approximations
• On learning of functions refutably.
• Refuting learning revisited.
• 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
• Unnamed Item

This page was built for publication: Trees and learning