A Reverse-Gold Theorem: Positive-Data Identification by Substrate-Bounded Contrastive Learners
arXiv:2610.28747v1 Announce Type: new Abstract: Gold's theorem shows that no learner can identify an arbitrary language in a superfinite class from positive presentations alone. We prove a positive result of a different shape. Fix an innate \emph{recursive contrast operator} $R$ mapping any string…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-10-22 04:00 · arXiv stat.ML
A Reverse-Gold Theorem: Positive-Data Identification by Substrate-Bounded Contrastive Learners