papersSEP 10 04:00 UTC
Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarchy
A new paper gives a complete characterization of when an algorithm can output valid unseen elements of an unknown infinite language from any exhaustive stream of positive examples. The authors show generation is possible exactly when families admit finite witnesses, and they structure the problem's difficulty into a separation-width hierarchy over countable domains. The result extends classical inductive inference and language learnability theory to arbitrary families.
computational learning theoryfinite witnessesinductive inferencelanguage generationlanguage learnability theoryseparation-width hierarchy
COVERAGE · 2 REPORTS · LINKS GO TO THE ORIGINAL OUTLETS
arXiv cs.LGCharacterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarch ↗SEP 10 04:00 UTC
arXiv cs.LGCharacterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarchy ↗SEP 11 04:00 UTC