Ordinal mind change complexity of language identification

DOI10.1016/S0304-3975(99)00005-5MaRDI QIDQ1575840zbMATH OpenOpenAlexFDO

Authors Andris Ambainis, Sanjay Jain, A. K. Sharma

Publication date 23 August 2000

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

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00005-5

zbMATH Keywords

inductive inferencelearning machine

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Mind change complexity of learning logic programs
• Elementary formal systems, intrinsic complexity, and procrastination
• Generalized notions of mind change complexity

Cites work

• Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
• 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 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 408780 (Why is no real title available?)
• scientific article; zbMATH DE number 1351092 (Why is no real title available?)
• scientific article; zbMATH DE number 2077180 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• Language identification in the limit
• Monotonic and dual monotonic language learning
• Monotonic and non-monotonic inductive inference
• On the complexity of inductive inference
• On the role of procrastination in machine learning
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• The intrinsic complexity of language identification
• The structure of intrinsic complexity of learning

Cited in

(16)

• On the intrinsic complexity of learning recursive functions
• On learning unions of pattern languages and tree patterns in the mistake bound model.
• Generalized notions of mind change complexity
• Counting extensional differences in BC-learning
• Nonmonotonicity in the framework of parametric logic
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Mind change efficient learning
• Learning with ordinal-bounded memory from positive data
• Parsimony hierarchies for inductive inference
• Learning Theory
• Learning algebraic structures from text
• On the classification of recursive languages
• Set systems: order types, continuous nondeterministic deformations, and quasi-orders
• Elementary formal systems, intrinsic complexity, and procrastination
• Unifying logic, topology and learning in parametric logic
• On ordinal VC-dimension and some notions of complexity

This page was built for publication: Ordinal mind change complexity of language identification

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