An approach to intrinsic complexity of uniform learning

DOI10.1016/J.TCS.2006.07.040zbMath1153.68023OpenAlexW2132855633MaRDI QIDQ860823

Sandra Zilles

Publication date: 9 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.040

zbMATH Keywords

learning theoryinductive inferencerecursion theory

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

Learning recursive functions: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Synthesizing inductive expertise
• On uniform learnability of language families
• On the intrinsic complexity of learning recursive functions
• The synthesis of language learners.
• The intrinsic complexity of language identification
• On the intrinsic complexity of learning
• Toward a mathematical theory of inductive inference
• The structure of intrinsic complexity of learning
• Limiting recursion
• Language identification in the limit
• Algorithmic Learning Theory

This page was built for publication: An approach to intrinsic complexity of uniform learning