Ergodic and Diophantine properties of algorithms of Selmer type