Justification as truth-finding efficiency: how Ockham's Razor works

Authors:
Kevin T. Kelly
Affiliations:
College of Humanities & Social Sciences, Department of Philosophy, Carnegie Mellon University, Pittburgh, PA
Venue:
Minds and Machines - Machine learning as experimental philosophy of science
Year:
2004

Citing 5
Cited 5

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Bayesian model selection and model averaging

Journal of Mathematical Psychology
Machine Learning

Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Uncomputability: the problem of induction internalized

Theoretical Computer Science - Super-recursive algorithms and hypercomputation

Mind change efficient learning

Information and Computation
Ockham's razor, empirical complexity, and truth-finding efficiency

Theoretical Computer Science
Mind change optimal learning of Bayes net structure from dependency and independency data

Information and Computation
Mind change efficient learning

Information and Computation
Mind change efficient learning

COLT'05 Proceedings of the 18th annual conference on Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

I propose that empirical procedures, like computational procedures, are justified in terms of truth-finding efficiency. I contrast the idea with more standard philosophies of science and illustrate it by deriving Ockham's razor from the aim of minimizing dramatic changes of opinion en route to the truth.