RECURSIVE STRUCTURALIZATION IN ALGORITHM CYBERNETICS
BUSH JONES
(Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana 70803 (U.S.A.))
21
Abstract
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.
Citation
JONES, B. (1978), "RECURSIVE STRUCTURALIZATION IN ALGORITHM CYBERNETICS", Kybernetes, Vol. 7 No. 1, pp. 9-12. https://doi.org/10.1108/eb005465
Publisher
:MCB UP Ltd
Copyright © 1978, MCB UP Limited