Learning power and language expressiveness.

DOI10.1016/S0304-3975(02)00814-9zbMath1038.68098OpenAlexW2043220295MaRDI QIDQ1874277

Eric Martin, Frank Stephan, Arun Sharma

Publication date: 25 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00814-9

zbMATH Keywords

learning algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Refuting learning revisited.

Cites Work

• On the non-existence of maximal inference degrees for language identification
• Inductive inference of monotonic formal systems from positive data
• Classical recursion theory. The theory of functions and sets of natural numbers
• Inductive inference from theory laden data
• Foundations of inductive logic programming
• Decidability and essential undecidability
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Learning via queries
• Scientific discovery based on belief revision
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item