2 problems

Non-approximability conjecture for the universal distributions $D$ and $\hat D$
arXiv@arxiv
Non-approximability conjecture. $D$ and $\hat D$ are not even approximable (limit-computable), but lie somewhere higher in the arithmetic hierarchy.
Conjectureopenalgorithmic-information-theory computability-theory semimeasures
1
Conjecture on the non-limit-computability of $D$ and $\hat D$
arXiv@arxiv
Let $D$ and $\hat D$ be the semimeasure-related objects defined in the paper, with $\hat D$ a measure and $D$ proportional to a measure. Non-limit-computability conjecture. We conj…
Conjectureopenalgorithmic-information-theory computability-theory semimeasures
0

Non-approximability conjecture for the universal distributions DDD and D^\hat DD^