On the computational power of random strings (Q2271990): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.apal.2009.03.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2154007663
@@ Property / OpenAlex ID: W2154007663 / rank @@
+Normal rank
@@ Property / cites work @@
+What can be efficiently reduced to the Kolmogorov-random strings?
+Normal rank
@@ Property / cites work @@
+Power from Random Strings
@@ Property / cites work: Power from Random Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of monotone complexity
@@ Property / cites work: Degrees of monotone complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A Theory of Program Size Formally Identical to Information Theory
+Normal rank
@@ Property / cites work @@
+Incompleteness theorems for random reals
@@ Property / cites work: Incompleteness theorems for random reals / rank @@
+Normal rank
@@ Property / cites work @@
+Q5414578
@@ Property / cites work: Q5414578 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Randomness and Complexity
@@ Property / cites work: Algorithmic Randomness and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4042829
@@ Property / cites work: Q4042829 / rank @@
+Normal rank
@@ Property / cites work @@
+On the relation between descriptional complexity and algorithmic probability
+Normal rank
@@ Property / cites work @@
+Three approaches to the quantitative definition of information<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+On the complexity of random strings
@@ Property / cites work: On the complexity of random strings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4070738
@@ Property / cites work: Q4070738 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4070739
@@ Property / cites work: Q4070739 / rank @@
+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 @@
+Q4337021
@@ Property / cites work: Q4337021 / rank @@
+Normal rank
@@ Property / cites work @@
+Kolmogorov entropy in the context of computability theory
+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 @@
+A formal theory of inductive inference. Part I
@@ Property / cites work: A formal theory of inductive inference. Part I / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2271990