>Has anyone implemented loops in ECJ?
I use kind of  loops in graph growth algorithm. (search, Growing adaptive
neural networks with graph grammars, or Gruau for example)
But genome is list where genes can freely point  two other genes, so genome
is kind of directed graph and it naturally creates iterations. So it should
create modular structures. When graph node is evaluated it rule changes
before next evaluation.

>Could the ADF stack be leveraged somehow to do this?
Don't know that. Iterative pointers fit also in tree structure, but there
can be only one contaiment tree.

t. Harri


----- Original Message -----
From: "George Coles" <[log in to unmask]>
To: <[log in to unmask]>
Sent: Thursday, December 08, 2005 2:55 AM
Subject: automatically defined loops/iterations


> Hi,
>    Can anyone point me to an example of automatically defined loops
> that works with tree-based GP? Has anyone implemented loops in ECJ? I am
> contemplating beginning to add this feature to my copy of ECJ and it
> seems a bit daunting. Could the ADF stack be leveraged somehow to do
> this? As an aside, it seems odd that iteration and recursion are not
> more popular as a topic of discussion. I expect that I will really need
> iteration, at least, in my project, and I would think that many people
> would find it very valuable.
>
> Thanks
> George Coles