Turing degree of Solomonoff semi-measure We define the Solomonoff semi-measure $m$ on finite strings $x$ by

$$m(x) = \sum_{p: U(p) = x} 2^{-l(p)},$$

where $U$ is a universal prefix Turing machine, $U(p) = x$ means $U$ outputs $x$ on input $p$, and $l(p)$ is the length of $p$.
What is the Turing degree of (computing the first $n$ digits of) $m(x)$?
Note that from $ m (0) $ you can compute a version of Chaitin's $\Omega $. Moreover $ m (x) $ is left-c.e. uniformly in $ x $. So $ m $ has Turing degree $0'$.