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

DOI10.1016/J.TCS.2007.04.009MaRDI QIDQ2383597zbMATH OpenOpenAlexFDO

Authors Kevin T. Kelly

Publication date 19 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.04.009

zbMATH Keywords

empirical simplicity

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Ockham efficiency theorem for stochastic empirical methods
• How simplicity helps you find the truth without pointing at it
• Simplicity, Inference and Modelling
• Simplicity, truth, and the unending game of science
• Realism, rhetoric, and reliability

Cites work

• Causation, prediction, and search
• How to Tell When Simpler, More Unified, or LessAd HocTheories will Provide More Accurate Predictions
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1233702 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 2038320 (Why is no real title available?)
• scientific article; zbMATH DE number 3444596 (Why is no real title available?)
• scientific article; zbMATH DE number 3060434 (Why is no real title available?)
• Inferring conservation laws in particle physics: A case study in the problem of induction
• Knowledge in flux. Modeling the dynamics of epistemic states
• Language identification in the limit
• Means-Ends Epistemology
• Minimum description length induction, Bayesianism, and Kolmogorov complexity
• On the complexity of inductive inference
• On the role of procrastination in machine learning
• Trial and error predicates and the solution to a problem of Mostowski
• Uncomputability: The problem of induction internalized

Cited in

(10)

• Testability and Ockham's razor: How formal and statistical learning theory converge in the new riddle of induction
• Simplicity and model selection
• Theory choice, theory change, and inductive truth-conduciveness
• Among several successful algorithms, simpler ones usually work better: a possible explanation of an empirical observation
• Russell and Wittgenstein on Occam’s Razor
• Simplicity, truth, and the unending game of science
• On not changing the problem: a reply to Howson
• Realism, rhetoric, and reliability
• How simplicity helps you find the truth without pointing at it
• Ockham efficiency theorem for stochastic empirical methods

Describes a project that uses

Uses Software

• TETRAD

This page was built for publication: Ockham's razor, empirical complexity, and truth-finding efficiency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383597)