ON SELF-MODIFYING PROGRAMS

A model for self-modifying program schemata is presented. Essentially this augments Ianov program schemata with certain self-modifying primitives. An appropriate algorithm for the decomposition of a directed graph is developed and applied to yield a Ianov schema equivalent to a given self modifying schema. Generalizations of the model are considered. In particular, certain growing programs are seen to lie outside the class of Ianov schemata.