Ockham efficiency theorem for stochastic empirical methods

DOI10.1007/S10992-010-9145-3MaRDI QIDQ613037zbMATH OpenOpenAlexFDO

Authors Kevin T. Kelly, Conor Mayo-Wilson

Publication date 17 December 2010

Published in Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL https://figshare.com/articles/journal_contribution/Ockham_Efficiency_Theorem_for_Stochastic_Empirical_Methods/6492353

zbMATH Keywords

simplicitystochastic processmixed strategyOckham's razorproblem of induction

Mathematics Subject Classification ID

Logic in the philosophy of science (03A10)

Recommendations

• Ockham's razor, empirical complexity, and truth-finding efficiency
• Realism, rhetoric, and reliability
• An automatic Ockham's razor for Bayesians?
• How simplicity helps you find the truth without pointing at it
• scientific article; zbMATH DE number 2089996

Cites work

• scientific article; zbMATH DE number 3136643 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 3434895 (Why is no real title available?)
• scientific article; zbMATH DE number 3444596 (Why is no real title available?)
• scientific article; zbMATH DE number 3225772 (Why is no real title available?)
• scientific article; zbMATH DE number 3189754 (Why is no real title available?)
• scientific article; zbMATH DE number 3061365 (Why is no real title available?)
• Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
• How simplicity helps you find the truth without pointing at it
• How to Tell When Simpler, More Unified, or LessAd HocTheories will Provide More Accurate Predictions
• Inferring conservation laws in particle physics: A case study in the problem of induction
• Knowledge in flux. Modeling the dynamics of epistemic states
• Locally Nice Embeddings of Manifolds
• Mind Change Optimal Learning of Bayes Net Structure
• Nash equilibria of \(n\)-player repeated games with semi-standard information
• Ockham efficiency theorem for stochastic empirical methods
• Ockham's razor, empirical complexity, and truth-finding efficiency
• On a Theorem of De Finetti, Oddsmaking, and Game Theory
• On the foundations of game theory: the case of non-archimedean utilities
• Rethinking the Foundations of Statistics
• Severe Testing as a Basic Concept in a Neyman–Pearson Philosophy of Induction
• Simplicity, truth, and the unending game of science
• The Solution of Infinite Zero-Sum Two-Person Games with Finitely Additive Strategies

Cited in

(5)

• Ockham efficiency theorem for stochastic empirical methods
• Realism, rhetoric, and reliability
• How simplicity helps you find the truth without pointing at it
• Ockham's razor, empirical complexity, and truth-finding efficiency
• Simplicity, truth, and the unending game of science

Describes a project that uses

Uses Software

• TETRAD

This page was built for publication: Ockham efficiency theorem for stochastic empirical methods

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