Learning correction grammars

DOI10.2178/jsl/1243948324zbMath1193.03067MaRDI QIDQ3630576

Lorenzo Carlucci, Sanjay Jain, John Case

Publication date: 4 June 2009

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1243948324

zbMATH Keywords

learning in the limit; computably enumerable languages; learning correction grammars

Mathematics Subject Classification ID

68Q32: Computational learning theory

03D05: Automata and formal grammars in connection with logical questions

91E40: Memory and learning in psychology

Related Items

Rice and Rice-Shapiro Theorems for transfinite correction grammars, Program Size Complexity of Correction Grammars in the Ershov Hierarchy, Difficulties in Forcing Fairness of Polynomial Time Inductive Inference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the role of procrastination in machine learning
• Program size restrictions in computational learning
• Proof-theoretic analysis of termination proofs
• On a hierarchy of sets. III
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Tradeoffs in the inductive inference of nearly minimal size programs
• Inductive inference of formal languages from positive data
• ON LEARNING LIMITING PROGRAMS
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Machine learning of higher-order programs
• Criteria of language learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Recursive Structures and Ershov's Hierarchy
• On the Forms of the Predicates in the Theory of Constructive Ordinals