On universal computably enumerable prefix codes (Q3616215): Difference between revisions

@@ Property / cites work @@
+Computability and Randomness
@@ Property / cites work: Computability and Randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Randomness and Complexity
@@ Property / cites work: Algorithmic Randomness and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Information Theory
@@ Property / cites work: Algorithmic Information Theory / 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 @@
+Natural halting probabilities, partial randomness, and zeta functions
+Normal rank
@@ Property / cites work @@
+A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
+Normal rank
@@ Property / cites work @@
+Q4806962
@@ Property / cites work: Q4806962 / rank @@
+Normal rank
@@ Property / cites work @@
+Kolmogorov complexity and Hausdorff dimension
@@ Property / cites work: Kolmogorov complexity and Hausdorff dimension / rank @@
+Normal rank
@@ Property / cites work @@
+On the entropy of context-free languages
@@ Property / cites work: On the entropy of context-free languages / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1017/s0960129508007238
+Normal rank
@@ Property / OpenAlex ID @@
+W2031395815
@@ Property / OpenAlex ID: W2031395815 / rank @@
+Normal rank