The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (Q285515): Difference between revisions

@@ Property / cites work @@
+Algorithmic tests and randomness with respect to a class of measures
+Normal rank
@@ Property / cites work @@
+Kolmogorov Complexity and Algorithmic                     Randomness
@@ Property / cites work: Kolmogorov Complexity and Algorithmic Randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Q4074808
@@ Property / cites work: Q4074808 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theory of Program Size Formally Identical to Information Theory
+Normal rank
@@ 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
+Normal rank
@@ Property / cites work @@
+The definition of random sequences
@@ Property / cites work: The definition of random sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Expressions for Some Randomness Tests
@@ Property / cites work: Exact Expressions for Some Randomness Tests / rank @@
+Normal rank
@@ Property / cites work @@
+Process complexity and effective random tests
@@ Property / cites work: Process complexity and effective random tests / rank @@
+Normal rank
@@ Property / cites work @@
+Q4070738
@@ Property / cites work: Q4070738 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4109577
@@ Property / cites work: Q4109577 / rank @@
+Normal rank
@@ Property / cites work @@
+On initial segment complexity  and degrees of randomness
+Normal rank