2
$\begingroup$

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)$?

$\endgroup$
5
  • $\begingroup$ Is "computing the first $n$ digits of" $m(x)$ (with $n$ as an input) known to $\hspace{1.89 in}$ be equivalent to computing $m(x)$? $\;$ $\endgroup$
    – user6973
    May 7, 2015 at 4:16
  • $\begingroup$ We can certainly only ever compute a finite sequence of digits of $m(x)$, so the two mean the same thing $\endgroup$
    – Andrew
    May 7, 2015 at 13:02
  • $\begingroup$ How does that follow? $\:$ (Consider the sequence of real numbers whose $m$-th entry is the limit of the sequence whose $n$-th term is 0.499999...[$t$ of them]...99999, where $t$ is the maximum of $n$ and the number of steps that $U(m)$ runs for.) $\;\;\;\;$ $\endgroup$
    – user6973
    May 7, 2015 at 13:46
  • $\begingroup$ @RickyDemer Ah, sorry, I misunderstood. Are you referring to this issue: en.wikipedia.org/wiki/… ? It looks like I should have used the "modern definition" rather than Minsky's. $\endgroup$
    – Andrew
    May 7, 2015 at 15:23
  • $\begingroup$ Yes. ${}{}{}\;$ $\endgroup$
    – user6973
    May 7, 2015 at 16:01

1 Answer 1

3
$\begingroup$

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'$.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.