Note on a central lemma for learning theory (Q794446): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-2496(83)90027-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025659114 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124879123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a mathematical theory of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decidability results on grammatical inference and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4189277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank

Latest revision as of 12:07, 14 June 2024

scientific article
Language Label Description Also known as
English
Note on a central lemma for learning theory
scientific article

    Statements

    Note on a central lemma for learning theory (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    The paper is a contribution to text identification in learning theory. It begins with the enunciation and proof of a classical result - the Blum and Blum Lemma about the existence of finite locking sequences for any learning function f and any language L which f identifies [\textit{L. Blum} and \textit{M. Blum}, Inf. Control 28, 125-155 (1975; Zbl 0375.02028)]. The importance of this Lemma and some of its applications are also presented. Then, the metric \(d(t,s)=\sum_{t_ n\neq s_ n}2^{-n}\) is introduced on \({}^ NN\) (the set of infinite sequences with elements from N), and \((^ NN,d)\) becomes a complete metric space. The Blum and Blum Lemma is reformulated and proved in this context. This result appears now as a consequence of rather general, topological considerations. The usefulness of this approach is then emphasized, by proving other interesting results about other learning paradigms.
    0 references
    text identification
    0 references
    learning theory
    0 references
    finite locking sequences
    0 references
    learning function
    0 references
    metric space
    0 references
    topological considerations
    0 references

    Identifiers