General linear relations between different types of predictive complexity (Q5958290): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00039-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033194803 / rank | |||
Normal rank | |||
Latest revision as of 09:52, 30 July 2024
scientific article; zbMATH DE number 1715291
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | General linear relations between different types of predictive complexity |
scientific article; zbMATH DE number 1715291 |
Statements
General linear relations between different types of predictive complexity (English)
0 references
3 March 2002
0 references
computational learning theory
0 references
generalisation of Kolmogorov complexity
0 references
tight inequalities
0 references
