Get started
Author

Tom F. Sterkenburg

Observed names: Sterkenburg, T.F. (Tom), Sterkenburg, Tom, Sterkenburg, Tom F., T.F. Sterkenburg, TOM F. STERKENBURG, Tom Florian Sterkenburg, Tom Sterkenburg
Observed institutions: Centrum Wiskunde & Informatica, University of Groningen, Munich School of Philosophy, Munich Center for Machine Learning, Ludwig-Maximilians-Universität München, University of Amsterdam
ORCID: 0000-0002-4860-727X
Observed ORCID: 0000-0002-4860-727X
OpenAlex ID: A5012807381
The no-free-lunch theorems of supervised learning
2021 · Tom F. Sterkenburg, Peter D. Grünwald · Synthese · 93
PDF
The Metainductive Justification of Induction: The Pool of Strategies
2019 · Tom F. Sterkenburg · Philosophy of Science · 31
The Meta-inductive Justification of Induction
2019 · Tom F. Sterkenburg · Episteme · 31
Putnam’s Diagonal Argument and the Impossibility of a Universal Learning Machine
2018 · Tom F. Sterkenburg · Erkenntnis · 16
Solomonoff Prediction and Occam’s Razor
2016 · Tom F. Sterkenburg · Philosophy of Science · 14
PDF
Statistical Learning Theory and Occam’s Razor: The Core Argument
2024 · Tom F. Sterkenburg · Minds and Machines · 10
PDF
Sequences With Trivial Initial Segment Complexity
2011 · Tom F. Sterkenburg · Data Archiving and Networked Services (DANS) · 5
Universal Prediction: A Philosophical Investigation
2018 · Tom F. Sterkenburg · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 4
PDF
On the number of infinite sequences with trivial initial segment complexity
2011 · George Barmpalias, T.F. Sterkenburg · Theoretical Computer Science · 4
PDF
Ruminations on Floridi’s Conjecture
2026 · David S. Watson, Tom F. Sterkenburg · Philosophy & Technology · 3
PDF
Commentary on David Watson, “On the Philosophy of Unsupervised Learning,” Philosophy & Technology
2023 · Tom F. Sterkenburg · Philosophy & Technology · 3
PDF
On Explaining the Success of Induction
2021 · Tom F. Sterkenburg · The British Journal for the Philosophy of Science · 3
PDF
The CWI World Cup Competition: Eliciting Sets of Acceptable Gambles
2017 · Quaeghebeur, Erik, Wesseling, Chris, et al. · VU Research Portal · 3
PDF
On characterizations of learnability with computable learners
2022 · Sterkenburg, Tom F. · arXiv (Cornell University) · 2
PDF
The Foundations of Solomonoff Prediction
2013 · Tom F. Sterkenburg · Utrecht University Repository (Utrecht University) · 2
Values in machine learning: what follows from underdetermination?
2026 · Tom F. Sterkenburg · AI and Ethics · 1
Review of John D. Norton’s The Material Theory of Induction - John D. Norton, The Material Theory of Induction. Calgary: University of Calgary Press (2021), 680 pp. $119.99 (hardcover)
2023 · Tom F. Sterkenburg · Philosophy of Science · 1
PDF
A Generalized Characterization of Algorithmic Probability
2017 · Tom F. Sterkenburg · Theory of Computing Systems · 1
PDF
Eliciting sets of acceptable gambles — The CWI World Cup Competition
2015 · Erik Quaeghebeur, Chris Wesseling, et al. · Data Archiving and Networked Services (DANS) · 1
PDF
Benign interpolation and Occam's razor
2026 · Sterkenburg, Tom F., Herrmann, Daniel A., et al. · arXiv (Cornell University)
PDF
Statistical learning theory and Occam's razor: Regularization
2026 · Sterkenburg, Tom F. · arXiv (Cornell University)
PDF
Solomonoff induction
2026 · Sterkenburg, Tom F. · arXiv (Cornell University)
PDF
On the Truth-convergence of Open-minded Bayesianism
2021 · TOM F. STERKENBURG, RIANNE DE HEIDE · The Review of Symbolic Logic
PDF
Deborah G. Mayo: Statistical Inference as Severe Testing: How to Get Beyond the Statistics Wars
2019 · Tom F. Sterkenburg · Journal for General Philosophy of Science
De mythe van big data
2014 · T.F. Sterkenburg · Data Archiving and Networked Services (DANS)
Works count: 32
Citation count: 229
H-index: 6
I10-index: 6
Year
Topic
Type