Variants of Solomonoff induction: Difference between revisions

Revision as of 02:38, 31 March 2019

This page lists some variants of Solomonoff induction.

Source	Formula	Determinism	Type of machine used	Discrete vs continuous
LessWrong Wiki^[1]	$m(y_{0})=\sum _{p\in {\mathcal {P}}:U(p)=y_{0}}2^{-\ell (p)}$ where ${\mathcal {P}}$ is the set of self-delimiting programs	Deterministic	Page doesn't say, but uses self-delimiting programs and it's discrete, so prefix Turing machine?	Discrete because the output string $y_{0}$ is finite

@@ Line 5: / Line 5: @@
 ! Source !! Formula !! Determinism !! Type of machine used !! Discrete vs continuous
 |-
-| LessWrong Wiki<ref>https://wiki.lesswrong.com/wiki/Solomonoff_induction</ref> || <math>m(y_0) = \sum_{p \in \mathcal P : U(p) = y_0} 2^{\ell(p)}</math> || Deterministic || Page doesn't say, but uses self-delimiting programs || Discrete because the output string <math>y_0</math> is finite
+| LessWrong Wiki<ref>https://wiki.lesswrong.com/wiki/Solomonoff_induction</ref> || <math>m(y_0) = \sum_{p \in \mathcal P : U(p) = y_0} 2^{-\ell(p)}</math> where <math>\mathcal P</math> is the set of self-delimiting programs || Deterministic || Page doesn't say, but uses self-delimiting programs and it's discrete, so prefix Turing machine? || Discrete because the output string <math>y_0</math> is finite
 |}