Computable measures coprojection consistent with ordering relation is not necessarily computable
Mikhail Raskin · Moscow University Mathematics Bulletin · 2012
An example of two computable probabilistic measures on infinite binary sequences is given so that these measures are comparable (there exists their coupling forbidding the pairs of symbols with the first member less than the second one), but all such couplings are incomputable.