Learnability and positive equivalence relations

DOI10.1016/j.ic.2022.104913arXiv2012.01466OpenAlexW3107523316MaRDI QIDQ6186308

Ziyuan Gao, Frank Stephan, Sanjay Jain, David R. Belanger, Wei Li

Publication date: 2 February 2024

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.01466

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Reducibilities among equivalence relations induced by recursively enumerable structures
• An easy priority-free proof of a theorem of Friedberg
• Prescribed learning of r.e. classes
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• The synthesis of language learners.
• The intrinsic complexity of language identification
• Learning families of algebraic structures from informant
• Graphs realised by r.e. equivalence relations
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• Inductive inference of formal languages from positive data
• Rekursive Algebren mit Kettenbedingungen
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Some decidability results on grammatical inference and complexity
• Language identification in the limit
• Vacillatory and BC learning on noisy data
• Learning algebraic structures from text

This page was built for publication: Learnability and positive equivalence relations