Journal of Philosophical Logic 39 (6):679-712 (2010)
Ockham’s razor is the principle that, all other things being equal, scientists ought to prefer simpler theories. In recent years, philosophers have argued that simpler theories make better predictions, possess theoretical virtues like explanatory power, and have other pragmatic virtues like computational tractability. However, such arguments fail to explain how and why a preference for simplicity can help one find true theories in scientific inquiry, unless one already assumes that the truth is simple. One new solution to that problem is the Ockham efficiency theorem, which states that scientists who heed Ockham’s razor retract their opinions less often and sooner than do their non-Ockham competitors. The theorem neglects, however, to consider competitors following random strategies and in many applications random strategies are known to achieve better worst-case loss than deterministic strategies. In this paper, we describe two ways to extend the result to a very general class of random, empirical strategies. The first extension concerns expected retractions, retraction times, and errors and the second extension concerns retractions in chance, times of retractions in chance, and chances of errors
|Categories||categorize this paper)|
References found in this work BETA
Causation, Prediction, and Search.Peter Spirtes, Clark Glymour & Richard Scheines - 1996 - British Journal for the Philosophy of Science 47 (1):113-123.
Citations of this work BETA
How Can Questions Be Informative Before They Are Answered? Strategic Information in Interrogative Games.Emmanuel J. Genot & Justine Jacot - 2012 - Episteme 9 (2):189-204.
Similar books and articles
Kelly on Ockham's Razor and Truth-Finding Efficiency.Simon Fitzpatrick - 2013 - Philosophy of Science 80 (2):298-309.
Justification as Truth-Finding Efficiency: How Ockham's Razor Works.Kevin T. Kelly - 2004 - Minds and Machines 14 (4):485-505.
Ockham's Razor, Empirical Complexity, and Truth-Finding Efficiency.Kevin Kelly - 2007 - Theoretical Computer Science 383:270-289.
Ockham's New Razor.Wen-Fang Wang - 2008 - Proceedings of the Xxii World Congress of Philosophy 17:149-161.
On Ockham Algebras: Congruence Lattices and Subdirectly Irreducible Algebras.P. Garcia & F. Esteva - 1995 - Studia Logica 55 (2):319 - 346.
A Complete Theory of Everything (Will Be Subjective).Marcus Hutter - 2010 - Algorithms 3 (4):329-350.
Simplicity, Inference and Modeling: Keeping It Sophisticatedly Simple.Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.) - 2001 - Cambridge University Press.
The Other Edge of Ockham's Razor: The A-PR Hypothesis and the Origin of Mind. [REVIEW]Zann Gill - 2013 - Biosemiotics 6 (3):403-419.
Added to index2010-09-14
Total downloads36 ( #144,718 of 2,178,141 )
Recent downloads (6 months)1 ( #316,663 of 2,178,141 )
How can I increase my downloads?