Occam's razor (Q1108056)

From MaRDI portal
Revision as of 12:38, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Occam's razor
scientific article

    Statements

    Occam's razor (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    We show that a polynomial learning algorithm, as defined by \textit{L. G. Valiant} [Commun. ACM 27, 1134-1142 (1984; Zbl 0587.68077)], is obtained whenever there exists a polynomial-time method of producing, for any sequence of observations, a nearly minimum hypothesis that is consistent with these observations.
    0 references
    machine learning
    0 references
    inductive inference
    0 references
    Occam's razor
    0 references
    methodology of science
    0 references

    Identifiers