A Semitechnical Interlude on the Equivalence of Probabilistic and Deterministic Solomonoff Induction

·LessWrong··

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 →

Related Articles

Every AI model has the same "controversial" take on humans
rakannimer · Hacker News · 5h ago
Jailbreaking the Switch 2
ledoge · Hacker News · 14h ago
The recently proposed o(n log n) integer multiplication algorithm [pdf]
craigcitro · Hacker News · 19h ago
Security Disclosure
passenger · Hacker News · 1d ago
The 1.5°C goal of the Paris Agreement is no longer viable
velo_aprx · Hacker News · 1d ago