Variants of Solomonoff induction

This page lists some variants of Solomonoff induction.

Source	Formula	Determinism	Type of machine used	Discrete vs continuous
LessWrong Wiki	$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
Scholarpedia discrete universal a priori probability	$m(x)=\sum _{p:U(p)=x}2^{-\ell (p)}$	prefix Turing machine	discrete
Scholarpedia continuous universal a priori probability