RECURSIVE STRUCTURALIZATION IN ALGORITHM CYBERNETICS

An approach to the cybernetic design of a wide class of algorithms is presented. The approach allows the implicit elimination of symbolic forms for an algorithm, while the search for a symbolic form can be dynamically restricted to a narrow space of symbolic forms. The immediate practical use of the design concept is demonstrated.