Input-dependence in function-learning

DOI10.1007/s00224-009-9174-xzbMath1187.68396OpenAlexW2028252321MaRDI QIDQ733744

Frank Stephan, Eric Martin, Sanjay Jain

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9174-x

zbMATH Keywords

inductive inferenceteam learningrecursion theorylearning with additional informationvarious forms of input presentation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational limits on team identification of languages
• On the non-existence of maximal inference degrees for language identification
• Prudence and other conditions on formal language learning
• 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
• Extremes in the degrees of inferability
• Inductive inference of formal languages from positive data
• Inductive inference and unsolvability
• Toward a mathematical theory of inductive inference
• Language identification in the limit