General Mathematical Proof of Occam's Razor; Upgrading Theoretical Physicists' Methodology
Gabriel Leuenberger

TL;DR
This paper mathematically proves Occam's razor, validating it as a principle, and proposes that physicists should quantify the information content of models to improve research methodology and overcome stagnation.
Contribution
It provides a rigorous mathematical proof of Occam's razor and suggests a practical methodology for physicists to quantify model information content.
Findings
Mathematically validated Occam's razor.
Proposed quantifying models' information content in physics.
Suggested methodology to enhance theoretical physics research.
Abstract
This paper's first aim is to prove a modernized Occam's razor beyond a reasonable doubt. To summarize the main argument in one sentence: If we consider all possible, intelligible, scientific models of ever-higher complexity, democratically, the predictions most favored by these complex models will agree with the predictions of the simplest models. This fact can be proven mathematically, thereby validating Occam's razor. Major parts of this line of reasoning have long preexisted within the depths of the algorithmic information theory literature, but they have always left room for doubts of various kinds. Therefore, we increase the generality, completeness, clarity, accessibility, and credibility of these arguments by countering over a dozen objections. We build our mathematical proof of Occam's razor on the shoulders of the exact 'chain rule' for Kolmogorov complexity. Concerning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Space Science and Extraterrestrial Life · Chaos, Complexity, and Education
