Ignoring data may be the only way to learn efficiently (Q4290134): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/09528139408953785
+Normal rank
@@ Property / OpenAlex ID @@
+W2013541926
@@ Property / OpenAlex ID: W2013541926 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding patterns common to a set of strings
@@ Property / cites work: Finding patterns common to a set of strings / rank @@
+Normal rank
@@ Property / cites work @@
+A Machine-Independent Theory of the Complexity of Recursive Functions
+Normal rank
@@ Property / cites work @@
+Toward a mathematical theory of inductive inference
+Normal rank
@@ Property / cites work @@
+Saving the phenomena: Requirements that inductive inference machines not contradict known data
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Limiting recursion
@@ Property / cites work: Limiting recursion / rank @@
+Normal rank
@@ Property / cites work @@
+Language identification in the limit
@@ Property / cites work: Language identification in the limit / rank @@
+Normal rank
@@ Property / cites work @@
+Nonmonotonic and inductive logic. 1st international workshop, Karlsruhe, Germany, December 4--7, 1990. Proceedings
+Normal rank
@@ Property / cites work @@
+Polynomial-time inference of arbitrary pattern languages
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / 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