An incompressibility theorem for automatic complexity (Q5154787): Difference between revisions

@@ Property / describes a project that uses @@
+MathOverflow
@@ Property / describes a project that uses: MathOverflow / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3199072391
@@ Property / OpenAlex ID: W3199072391 / rank @@
+Normal rank
@@ Property / cites work @@
+Resource-Bounded Kolmogorov Complexity Revisited
@@ Property / cites work: Resource-Bounded Kolmogorov Complexity Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of protein folding
@@ Property / cites work: Complexity of protein folding / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic automatic complexity of overlap-free and almost square-free words
+Normal rank
@@ Property / cites work @@
+On the complexity of automatic complexity
@@ Property / cites work: On the complexity of automatic complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Few Paths, Fewer Words: Model Selection With Automatic Structure Functions
+Normal rank
@@ Property / cites work @@
+Q3214803
@@ Property / cites work: Q3214803 / rank @@
+Normal rank
@@ Property / cites work @@
+Three approaches to the quantitative definition of information<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Q4531381
@@ Property / cites work: Q4531381 / 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 @@
+A formal theory of inductive inference. Part II
@@ Property / cites work: A formal theory of inductive inference. Part II / rank @@
+Normal rank