Algebraic Analysis Of Goal-seeking Systems

This paper presents an approach to the algebraic analysis of learning paradigms. The technique is to map the learning paradigm into a learning automaton with certain convergence characteristics. Such automata have been studied by the authors and their algebraic structure analyzed. From this structure a lower bound can be assigned to the number of steps in a learning sequence. Using the mapping a similar lower bound can be deduced for the learning paradigm.