Abstract In this survey we discuss work of Levin and V’yugin on collections sequences that are non-negligible in the sense they can be computed by a probabilistic algorithm with positive probability. More precisely, introduced an ordering closed under Turing equivalence. Roughly speaking, given two such $\mathcal {A}$ {B}$ , is below if {A}\setminus \mathcal negligible. The degree structure ass...