The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (Q285515): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6582465 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Kolmogorov complexity | |||
| Property / zbMATH Keywords: Kolmogorov complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithmic randomness | |||
| Property / zbMATH Keywords: algorithmic randomness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
a priori probability | |||
| Property / zbMATH Keywords: a priori probability / rank | |||
Normal rank | |||
Revision as of 18:33, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite |
scientific article |
Statements
The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (English)
0 references
19 May 2016
0 references
Kolmogorov complexity
0 references
algorithmic randomness
0 references
a priori probability
0 references
