On the number of infinite sequences with trivial initial segment complexity. - George Barmpalias; Tom F. Sterkenburg (Theor. Comput. Sci., 2011)

The CWI World Cup Competition: Eliciting Sets of Acceptable Gambles. - Erik Quaeghebeur; Chris Wesseling; Emma Beauxis-Aussalet; Teresa Piovesan; Tom F. Sterkenburg (ISIPTA, 2017)

A Generalized Characterization of Algorithmic Probability. - Tom F. Sterkenburg (Theory Comput. Syst., 2017)

On characterizations of learnability with computable learners. - Tom F. Sterkenburg (COLT, 2022)

The no-free-lunch theorems of supervised learning. - Tom F. Sterkenburg; Peter D. Grünwald (CoRR, 2022)

On the Truth-convergence of Open-Minded Bayesianism. - Tom F. Sterkenburg; Rianne de Heide (Rev. Symb. Log., 2022)

Statistical learning theory and Occam's razor: The argument from empirical risk minimization. - Tom F. Sterkenburg (CoRR, 2023)

Statistical Learning Theory and Occam's Razor: The Core Argument. - Tom F. Sterkenburg (Minds Mach., 2025)