glimming wrote:   
   > Dear AI researchers,   
   >   
   > I am a research student at Stockholm University and I have fornally   
   > developed a notion of recursion   
   > on objects, this is defined in category theory/denotational semantics   
   > as a universal construction.   
   >   
   > I wonder if you have any examples of algorithms which are   
   > self-mutating, or which must compute on a data-set that includes   
   > operations (as opposed to values). For example, a graph where each   
   node   
   > contains not just values but also functions/operations, would fall   
   into   
   > this class of data. Ideally, the algorithm itself must change during   
   > the computation, but this is not a requirement for an example.   
      
   Hmmm. See the "Goedel Machine" of Schmidhuber for a program that   
   heavily relies on self-reference and self-modification.   
   Regards,   
      
   --   
   Eray Ozkural   
      
   [ comp.ai is moderated.  To submit, just post and be patient, or if ]   
   [ that fails mail your article to , and ]   
   [ ask your news administrator to fix the problems with your system. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)