David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
A ﬁnite data set is consistent with inﬁnitely many alternative theories. Scientiﬁc realists recommend that we prefer the simplest one. Anti-realists ask how a ﬁxed simplicity bias could track the truth when the truth might be complex. It is no solution to impose a prior probability distribution biased toward simplicity, for such a distribution merely embodies the bias at issue without explaining its eﬃcacy. In this note, I argue, on the basis of computational learning theory, that a ﬁxed simplicity bias is necessary if inquiry is to converge to the right answer eﬃciently, whatever the right answer might be. Eﬃciency is understood in the sense of minimizing the least ﬁxed bound on retractions or errors prior to convergence.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
Similar books and articles
R. Sorensen (2011). Simpler Without a Simplest: Ockham's Razor Implies Epistemic Dilemmas. Analysis 71 (2):260-264.
Daniel Steel (2009). Testability and Ockham's Razor: How Formal and Statistical Learning Theory Converge in the New Riddle of Induction. [REVIEW] Journal of Philosophical Logic 38 (5):471 - 489.
Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.) (2001). Simplicity, Inference and Modeling: Keeping It Sophisticatedly Simple. Cambridge University Press.
Kevin T. Kelly (2004). Justification as Truth-Finding Efficiency: How Ockham's Razor Works. Minds and Machines 14 (4):485-505.
Added to index2009-01-28
Total downloads11 ( #146,511 of 1,139,970 )
Recent downloads (6 months)1 ( #157,515 of 1,139,970 )
How can I increase my downloads?