The modification of Uznadze's algorithm in terms of robot's long-term and short-term memory

The paper describes a modification of Uznadze's algorithm of the theory of emotional robots. The new algorithm abandons a requirement of constancy and equality of coefficients of robot's short-term memory during robot's educational process, uses coefficient of robot's long-term memory for calculation of robot's education. The paper introduces a criterion of change of educational levels and describes a concept of robot's local education. There are proofs of two theorems. One of them is about a convergence of series of robot's education on every educational level. Another is about an unlimitedness of robot's educational process and reachability of any robot's educational goals.