Occam's razor (Q1108056): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational limitations on learning from examples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A theory of the learnable / rank | |||
Normal rank | |||
Latest revision as of 18:47, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Occam's razor |
scientific article |
Statements
Occam's razor (English)
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
