Algebra over estimation algorithms: the minimal degree of correct algorithms

Basic constructs of the algebraic theory of corrections of estimation algorithms are described. Algorithms belonging to algebraic closures are represented using linear combinations of simple operators. The case of the general proximity function is considered, and an unimprovable bound on the degree of a correct algorithm is obtained.