Intrinsic Complexity of Partial Learning

DOI10.1007/978-3-319-46379-7_12zbMath1472.68073OpenAlexW2523653520MaRDI QIDQ2830275

Sanjay Jain, E. B. Kinber

Publication date: 9 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-46379-7_12

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (1)

Intrinsic complexity of partial learning

Cites Work

• Unnamed Item
• Unnamed Item
• Learning regular sets from queries and counterexamples
• On the intrinsic complexity of learning recursive functions
• Language learning from texts: Degrees of intrinsic complexity and their characterizations
• The intrinsic complexity of language identification
• On the intrinsic complexity of learning
• Combining Models of Approximation with Partial Learning
• Computability-theoretic learning complexity
• A Survey on Recent Results on Partial Learning
• Confident and Consistent Partial Learning of Recursive Functions
• Inductive inference of formal languages from positive data
• On Conservative Learning of Recursively Enumerable Languages
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: Intrinsic Complexity of Partial Learning