LESSWRONG
LW

449
Wikitags

Occam's Razor

Edited by Ruby, et al. last updated 4th Jan 2022

Occam's razor (more formally referred to as the principle of parsimony) is a principle commonly stated as "Entities must not be multiplied beyond necessity". When several theories are able to explain the same observations, Occam's razor suggests the simpler one is preferable. It must be noted that Occam's razor is a requirement for the simplicity of theories, not for the size of the systems described by those theories. For example, the immensity of the Universe isn't at odds with the principle of Occam's razor.

Occam's razor is necessitated by the conjunction rule of probability theory: the conjunction A and B is necessarily less (or equally, in the case of logical equivalence) probable than the A alone; every detail you tack onto your story drives the probability down.

Occam's razor has been formalized as Minimum Description Length or Minimum Message Length, in which the total size of the theory is the length of the message required to describe the theory, plus the length of the message required to describe the evidence using the theory. Solomonoff induction is the ultimate case of minimum message length in which the code for messages can describe all computable hypotheses. This has jokingly been referred to as "Solomonoff's lightsaber".

Notable Posts

  • Occam's Razor
  • A Priori
  • Decoherence is Simple

See Also

  • Solomonoff induction
  • Occam's imaginary razor
  • Priors
  • Burdensome details
  • Egan's law

External Links

  • Ockham’s Razor: A New Justification
Subscribe
Discussion
1
Subscribe
Discussion
1
Posts tagged Occam's Razor
39Solomonoff induction still works if the universe is uncomputable, and its usefulness doesn't require knowing Occam's razor
Christopher King
2y
28
134Message Length
Zack_M_Davis
5y
25
67Belief in the Implied Invisible
Eliezer Yudkowsky
17y
34
144A Semitechnical Introductory Dialogue on Solomonoff Induction
Ω
Eliezer Yudkowsky
4y
Ω
32
143Occam's Razor
Eliezer Yudkowsky
18y
55
66Msg Len
Zack_M_Davis
5y
4
53Mathematics as a lossy compression algorithm gone wild
Shmi
11y
82
40Dissolving the Problem of Induction
Liron
5y
32
35What is an "anti-Occamian prior"?
Q
Zane
2y
Q
22
32Taking Occam Seriously
steven0461
16y
51
32The Coding Theorem — A Link between Complexity and Probability
Leon Lang
1mo
4
32Very Short Introduction to Bayesian Model Comparison
johnswentworth
6y
5
30Instrumental Occam?
QΩ
abramdemski
6y
QΩ
15
29Occam's Razor and the Universal Prior
Peter Chatain
4y
5
11Induction; or, the rules and etiquette of reference class tennis
paulfchristiano
13y
8
Load More (15/38)
Add Posts