Algorithmic complexity bounds on future prediction errors (Q865627)
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: Algorithmic complexity bounds on future prediction errors |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic complexity bounds on future prediction errors |
scientific article |
Statements
Algorithmic complexity bounds on future prediction errors (English)
0 references
20 February 2007
0 references
Kolmogorov complexity
0 references
posterior bounds
0 references
online sequential prediction
0 references
Solomonoff prior
0 references
monotone conditional complexity
0 references
total error
0 references
future loss
0 references
randomness deficiency
0 references
0 references
0 references
0 references
0.8939904
0 references
0.8852601
0 references
0.88099146
0 references
0 references
