Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546)

The question ''For which real numbers \(r\in [0,1]\) are all languages accepted by each probabilistic Turing machine (PTM) with probability greater than r always recursively enumerable?'' is investigated, and it is given as answer that r has this property iff the upper Dedekind cut of r is r.e. It is also shown that in the case that the lower Dedekind cut of r is r.e., a language L is accepted by some PTM with probability greater than or equal to r iff \(L\in \Pi^ 0_ 2.\) Reviewer's remark: These results were obtained under an implicit understanding that the relation \(''pr(w,k)>q''\) is recursive, where pr(w,k) is the probability that a given PTM accepts the input w in at most k steps. But this is not sure if the transition probabilities in a PTM are usual real numbers, even when they are computable real numbers! Of course, the obtained results are certainly true if all transition probabilities in the considered PTMs are required to be rational.