On the necessity of Occam algorithms (Q1193631): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4013524
@@ Property / cites work: Q4013524 / rank @@
+Normal rank
@@ Property / cites work @@
+Occam's razor
@@ Property / cites work: Occam's razor / rank @@
+Normal rank
@@ Property / cites work @@
+Learnability and the Vapnik-Chervonenkis dimension
+Normal rank
@@ Property / cites work @@
+A general lower bound on the number of examples needed for learning
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+Computational limitations on learning from examples
+Normal rank
@@ Property / cites work @@
+Prediction-preserving reducibility
@@ Property / cites work: Prediction-preserving reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum consistent DFA problem cannot be approximated within any polynomial
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(92)90367-o
+Normal rank
@@ Property / OpenAlex ID @@
+W2075121617
@@ Property / OpenAlex ID: W2075121617 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1193631