Occam's razor (Q1108056)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4066378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Occam's razor |
scientific article; zbMATH DE number 4066378 |
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
0.7858896255493164
0 references
0.78517085313797
0 references
0.7847610116004944
0 references
