News for hackers. Stuff that matters.
Re:New derivation of pi links quantum physics and pure math by murbard2 on Monday November 23, 2015 @08:34AM (#10614447)
Not necessarily shortest, but it has many short programs.

The algorithmic probability of a sequence x is the sum over the set of all prefix-free programs u that calculate x of 2^-len(u). Think of the shortest description length as a MAP, while the algorithmic probability integrates over the full prior.

A constant which has many short programs can thus have a greater algorithmic probability than another constant with a slightly lower Kolmogorov complexity. To put it back in context, it's possible that a very short program computes some constant, but it's unlikely to be an important mathematical constants. What's particular about mathematical constants is that they keep appearing in many different situations.

There are no comments on this comment yet.