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

The ChatGPT/Codex app bundles a full copy of LibreOffice
timpera · Hacker News · 14h ago
The Emergent Symbolic Structure of Artificial Neural Networks
schmuhblaster · Hacker News · 6h ago
I trained a small transformer in 1.5hrs and it beats many LLMs
porridgeraisin · Hacker News · 1d ago
Show HN: Running 104GB Qwen3.8-Flash-Next on 48GB Mac with at ~12 tok/s
carloslfu · Hacker News · 17h ago
Refurbishing a Tektronix TDS7104 Oscilloscope
jwise0 · Hacker News · 14h ago