Occam’s razor 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”.