Leuenberger, Gabriel (2025) General Mathematical Proof of Occam’s Razor; Upgrading Theoretical Physicists’ Methodology. [Preprint]

Text General_Mathematical_Proof_of_Occam_s_Razor__Upgrading_Theoretical_Physicists__Methodology.pdf Available under License Creative Commons Attribution Non-commercial Share Alike. Download (520kB)

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 physics, we then go on to diagnose the primary amendable root cause of the present stagnation of the research field of fundamental theoretical physics. We show that the effective antidote would consist in a practically feasible upgrade to the theoretical physicists' research methodology: When proposing new theoretical models, physicists should simply calculate and report the total amount of information that their models consist of. We explain why this methodology would be highly effective as well as how these calculations could be performed efficiently.

---

Export/Citation:

EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL

Social Networking:

Share |

---

Item Type:	Preprint
Creators:	Creators Email ORCID Leuenberger, Gabriel g.leuenberger@student.rug.nl 0000-0002-2737-5799
Keywords:	epistemology, metascience, methodology, Occam's razor, model complexity, Kolmogorov complexity, algorithmic information, MDL, fundamental physics, metamathematical regularization
Subjects:	Specific Sciences > Computation/Information General Issues > Laws of Nature Specific Sciences > Physics Specific Sciences > Probability/Statistics General Issues > Structure of Theories
Depositing User:	Mr. Gabriel Leuenberger
Date Deposited:	16 Jun 2025 13:26
Last Modified:	16 Jun 2025 13:26
Item ID:	25656
Subjects:	Specific Sciences > Computation/Information General Issues > Laws of Nature Specific Sciences > Physics Specific Sciences > Probability/Statistics General Issues > Structure of Theories
Date:	15 June 2025
URI:	https://philsci-archive.pitt.edu/id/eprint/25656

Monthly Views for the past 3 years

Monthly Downloads for the past 3 years

Plum Analytics

Actions (login required)

View Item