An almost machine-independent theory of program-length complexity, sophistication, and induction (Q2638781): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040360
@@ Property / cites work: Q4040360 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theory of Program Size Formally Identical to Information Theory
+Normal rank
@@ Property / cites work @@
+Q4074808
@@ Property / cites work: Q4074808 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3816976
@@ Property / cites work: Q3816976 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4070738
@@ Property / cites work: Q4070738 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomness conservation inequalities; information and independence in mathematical theories
+Normal rank
@@ Property / cites work @@
+Complexity oscillations in infinite binary sequences
+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 @@
+General random sequences and learnable sequences
@@ Property / cites work: General random sequences and learnable sequences / 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
@@ Property / cites work @@
+Complexity-based induction systems: Comparisons and convergence theorems
+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