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 |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00224-014-9604-2 / rank | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2002095405 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1401.1467 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic tests and randomness with respect to a class of measures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kolmogorov Complexity and Algorithmic Randomness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4074808 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The definition of random sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact Expressions for Some Randomness Tests / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Process complexity and effective random tests / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4070738 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4109577 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On initial segment complexity and degrees of randomness / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00224-014-9604-2 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:08, 28 December 2024
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