Why wouldn’t the probability of two algorithms of different lengths appearing approach the same value as longer strings of bits are searched?
Confused about Solomonoff induction
Why wouldn’t the probability of two algorithms of different lengths appearing approach the same value as longer strings of bits are searched?