In this paper we give an exposition of a theorem by Muchnik and Positselsky, showing that there is a universal prefix Turing machine U, with the property that there is no truth-table reduction from the halting problem to the set {(x,i) : there is a description d of length at most i such that U(d)=x}. This result is relevant for some recent complexity-theoretic investigations undertaken by the authors.