Why wouldn't the probability of two algorithms of different lengths appearing approach the same value as longer strings of bits are searched?
Because when you integrate an exponential, you get a constant.
Is this a joke?
Why wouldn't the probability of two algorithms of different lengths appearing approach the same value as longer strings of bits are searched?