“Simple” in O’s R means “simplest that explains the facts at all”. So you delete a bunch of hypotheses that are too simple to be explanatorily adequate, and then you delete the ones that are unnecessarily complex. That gives you soem sort of medium complexity.
My question was more about the medium length of an algorithm predicted by Solomonov induction.
Update: According to https://wiki.lesswrong.com/wiki/Solomonoff_induction the weight of hypothesis is diminishing very quickly, like 2power(-n), where n is the program length. And in this case, the medium level will somewhere between first and second hypothesis.
“Simple” in O’s R means “simplest that explains the facts at all”. So you delete a bunch of hypotheses that are too simple to be explanatorily adequate, and then you delete the ones that are unnecessarily complex. That gives you soem sort of medium complexity.
My question was more about the medium length of an algorithm predicted by Solomonov induction. Update: According to https://wiki.lesswrong.com/wiki/Solomonoff_induction the weight of hypothesis is diminishing very quickly, like 2power(-n), where n is the program length. And in this case, the medium level will somewhere between first and second hypothesis.
Are you using medium to mean median?
Yes, by mistake :(