Increasing the gap between descriptional complexity and algorithmic probability (Q3093481): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of monotone complexity
@@ Property / cites work: Degrees of monotone complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Incompleteness theorems for random reals
@@ Property / cites work: Incompleteness theorems for random reals / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Randomness and Complexity
@@ Property / cites work: Algorithmic Randomness and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the relation between descriptional complexity and algorithmic probability
+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 @@
+Q3611832
@@ Property / cites work: Q3611832 / 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 @@
+Relations between varieties of kolmogorov complexities
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1090/s0002-9947-2011-05315-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2018578203
@@ Property / OpenAlex ID: W2018578203 / rank @@
+Normal rank