Input-dependence in function-learning

DOI10.1007/S00224-009-9174-XzbMATH Open1187.68396OpenAlexW2028252321MaRDI QIDQ733744FDOQ733744

Frank Stephan, Éric 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 inferencerecursion theorylearning with additional informationteam learningvarious 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

• Title not available (Why is that?)
• Inductive inference of formal languages from positive data
• Title not available (Why is that?)
• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Language identification in the limit
• Prudence and other conditions on formal language learning
• Classical recursion theory. The theory of functions and sets of natural numbers
• Inductive inference and unsolvability
• Extremes in the degrees of inferability
• On the structure of degrees of inferability.
• Title not available (Why is that?)
• Computational limits on team identification of languages
• On the non-existence of maximal inference degrees for language identification
• Probability and plurality for aggregations of learning machines

Cited In (2)

• Trees and learning
• Learning Behaviors of Functions

   Recommendations

• Input-Dependence in Function-Learning 👍 👎
• Learning behaviors of functions with teams 👍 👎
• Title not available (Why is that?) 👍 👎
• Extremes in the degrees of inferability 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Input-dependence in function-learning

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