Separation of uniform learning classes.

DOI10.1016/J.TCS.2003.11.007zbMath1069.68059OpenAlexW2007275089MaRDI QIDQ1426150

Sandra Zilles

Publication date: 14 March 2004

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

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

zbMATH Keywords

Learning theoryInductive inferenceRecursion theory

Mathematics Subject Classification ID

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

Related Items (5)

Prescribed Learning of R.E. Classes ⋮ Learning recursive functions: A survey ⋮ Numberings optimal for learning ⋮ Increasing the power of uniform inductive learners ⋮ Prescribed learning of r.e. classes

Cites Work

• Comparison of identification criteria for machine inductive inference
• Synthesizing inductive expertise
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• On uniform learnability of language families
• The synthesis of language learners.
• How inductive inference strategies discover their errors
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Separation of uniform learning classes.