Robust algorithms for adaptation set in a general formal framework

This paper presents a general formalism for defining problems of adaptation. Within this formalism a class of algorithms, the sequential reproductive plans, is defined. It is then proved that sequential reproductive plans are robust in the sense that, in environments with a well-defined measure of payoff (utility, performance), any such plan will acquire payoff at a rate which asymptotically approaches the optimum.