Note on a central lemma for learning theory

DOI10.1016/0022-2496(83)90027-5zbMATH Open0541.68062OpenAlexW2025659114WikidataQ124879123 ScholiaQ124879123MaRDI QIDQ794446FDOQ794446

Authors: Daniel N. Osherson, Michael Stob, Scott Weinstein 

Publication date: 1983

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(83)90027-5

Recommendations

• Learning Theory and Descriptive Set Theory
• Learning and computing in the limit
• A result of Vapnik with applications
• Learning theorems
• Learning and classifying

zbMATH Keywords

learning theorymetric spacefinite locking sequenceslearning functiontext identificationtopological considerations

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Metric spaces, metrizability (54E35) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Language identification in the limit
• Some decidability results on grammatical inference and complexity
• Title not available (Why is that?)

Cited In (5)

• Characterizing language identification by standardizing operations
• Learning theorems
• Prudence and other conditions on formal language learning
• Gold-Style Learning Theory
• Topological separations in inductive inference

This page was built for publication: Note on a central lemma for learning theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794446)