PhilSci Archive

Items where Author is "Sterkenburg, Tom F."

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 10.

Sterkenburg, Tom F. (2023) Statistical Learning Theory and Occam's Razor: The Argument from Empirical Risk Minimization. [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.

This list was generated on Fri Mar 29 07:46:09 2024 EDT.