The representation and manipulation of the algorithmic probability measure for problem solving. (Q1354086): Difference between revisions

@@ 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 @@
+On the Length of Programs for Computing Finite Binary Sequences
+Normal rank
@@ Property / cites work @@
+Q3214803
@@ Property / cites work: Q3214803 / rank @@
+Normal rank
@@ Property / cites work @@
+On the difficulty of computations
@@ Property / cites work: On the difficulty of computations / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity-based induction systems: Comparisons and convergence theorems
+Normal rank
@@ Property / cites work @@
+Q5578545
@@ Property / cites work: Q5578545 / rank @@
+Normal rank
@@ Property / cites work @@
+Information-theoretic computation complexity
@@ Property / cites work: Information-theoretic computation complexity / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01531061
+Normal rank
@@ Property / OpenAlex ID @@
+W2067623858
@@ Property / OpenAlex ID: W2067623858 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/amai/Gammerman91
@@ Property / DBLP publication ID: journals/amai/Gammerman91 / rank @@
+Normal rank