. It really is a shame that more philosophers don’t know how Solomonoff induction works.
Does it work? SIs can only reject non natural hypotheses if they can test them, and only test them if they can express them in code. Can they? Note that the programmes in an SI can’t even represent continua/uncountability.
Does it work? SIs can only reject non natural hypotheses if they can test them, and only test them if they can express them in code. Can they? Note that the programmes in an SI can’t even represent continua/uncountability.