A Semitechnical Interlude on the Equivalence of Probabilistic and Deterministic Solomonoff Induction
ASHLEY: Did you say something earlier about the deterministic and probabilistic versions of Solomonoff induction giving the same answers? Like, is it a distinction without a difference whether we ask about simple programs that reproduce the observed data versus simple programs that assign high probability to the data? I can't see why that should be true, especially since Turing machines don't include a randomness source.BLAINE: I'm told the answers are the same but I confess I can't quite see wh...
Read full article →