Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with single algebraic operation, namely construct for binary probabilistic choice. What matters about such computations is the probability of obtaining any given result, rather than possibility or necessity it, like in (non)deterministic computation. Termination, arguably simplest kind reachability pr...