Items where Author is "Sterkenburg, Tom F."
Group by: Item Type | No Grouping Number of items: 11. Sterkenburg, Tom F. (2024) Statistical Learning Theory and Occam's Razor: The Core Argument. Minds and Machines. Sterkenburg, Tom F. (2024) Values in machine learning: What follows from underdetermination? [Preprint] Sterkenburg, Tom F. and Grünwald, Peter D. (2021) The No-Free-Lunch Theorems of Supervised Learning. Synthese. Sterkenburg, Tom F. (2021) On Explaining the Success of Induction. The British Journal for the Philosophy of Science. Sterkenburg, Tom F. and De Heide, Rianne (2021) On the Truth-Convergence of Open-Minded Bayesianism. The Review of Symbolic Logic. Sterkenburg, Tom F. and Grünwald, Peter D. (2020) The No-Free-Lunch Theorems of Supervised Learning. [Preprint] Sterkenburg, Tom F. (2019) The Meta-Inductive Justification of Induction. Episteme. Sterkenburg, Tom F. (2019) The Meta-Inductive Justification of Induction: The Pool of Strategies. Philosophy of Science. Sterkenburg, Tom F. (2018) Universal Prediction. Sterkenburg, Tom F. (2018) Putnam's Diagonal Argument and the Impossibility of a Universal Learning Machine. Erkenntnis. Sterkenburg, Tom F. (2016) Solomonoff Prediction and Occam's Razor. Philosophy of Science, 83 (4). pp. 459-479. |
![[feed]](http://philsci-archive.pitt.edu/style/images/feed-icon-32x32.png){kind=icon}