Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities (Q466362)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities |
scientific article; zbMATH DE number 6361636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities |
scientific article; zbMATH DE number 6361636 |
Statements
Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities (English)
0 references
27 October 2014
0 references
machine training
0 references
recursive functions
0 references
VC-dimension
0 references
Kolmogorov complexity
0 references
0.7313110828399658
0 references
0.7188748717308044
0 references
0.7121225595474243
0 references
