On the learnability of recursively enumerable languages from good examples

DOI10.1016/S0304-3975(00)00131-6MaRDI QIDQ5941366zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, S. Lange, J. Nessel

Publication date 20 August 2001

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

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00131-6

zbMATH Keywords

computational learning theorygood examplesinductive inference

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Learning recursive languages from good examples
• Partial learning of recursively enumerable languages
• Partial learning of recursively enumerable languages
• On conservative learning of recursively enumerable languages
• scientific article; zbMATH DE number 1453044
• scientific article; zbMATH DE number 1104342
• Learning regular languages from counterexamples
• Set-driven and rearrangement-independent learning of recursive languages
• Learnability: admissible, co-finite, and hypersimple languages
• Learnability: Admissible, co-finite, and hypersimple languages

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Comparison of identification criteria for machine inductive inference
• Elementary formal systems, intrinsic complexity, and procrastination
• Finding patterns common to a set of strings
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3960850 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Incremental concept learning for bounded data mining.
• Inductive inference from all positive and some negative data
• Inductive inference of formal languages from positive data
• Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
• Language identification in the limit
• Language learning with some negative information
• Learning recursive languages from good examples
• On the power of inductive inference from good examples
• Prudence and other conditions on formal language learning
• Teachability in computational learning
• Teaching a smarter learner.
• Toward a mathematical theory of inductive inference

Cited in

(19)

• Generalization and specialization strategies for learning r. e. languages
• Learning recursive languages from good examples
• The complexity of universal text-learners.
• Learning languages with decidable hypotheses
• On the data consumption benefits of accepting increased uncertainty
• Learning finite variants of single languages from informant
• Learnability of co-r.e. classes
• Recent Developments in Algorithmic Teaching
• scientific article; zbMATH DE number 1104342 (Why is no real title available?)
• scientific article; zbMATH DE number 2077176 (Why is no real title available?)
• On the help of bounded shot verifiers, comparators and standardisers for learnability in inductive inference
• Normal forms in semantic language identification
• Set-driven and rearrangement-independent learning of recursive languages
• scientific article; zbMATH DE number 6160572 (Why is no real title available?)
• scientific article; zbMATH DE number 1453034 (Why is no real title available?)
• Teaching randomized learners with feedback
• Robust identification in the limit from incomplete positive data
• Co-learning of recursive languages from positive data
• Learning indexed families of recursive languages from positive data: A survey

This page was built for publication: On the learnability of recursively enumerable languages from good examples

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