"DavidM" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
> So if someone can point me in the direction of an algebraic expressions
> library that can simplify expression trees and weed out redundancies, that
> would be awesome.
half-joking:
Maxima http://maxima.sourceforge.net/ --
DavidM <[EMAIL PROTECTED]> wrote:
...
> Seems that I have to allow a 'punishment free' threshold of complexity,
> otherwise the population stagnates.
Sounds like you've hit on a good simulation of life: to get innovation,
you must be very tolerant of errors!-)
Alex
--
http://mail.python.org/
On Tue, 26 Jun 2007 04:22:23 -0700, Mark Westwood wrote:
> I'm with Robin Becker on this one, if GP is good enough for your
> problem, then the answers it produces should be good enough. Set the
> fitness criteria in favour of shorter rather than longer expressions
> and let you system run a litt
Hi David
It seems that all you are asking for are the capabilities of
Mathematica or Maple or some other CAS. A quick Google reveals that
there is a CAS written in Python, called SAGE. That might be a good
place to start; but I'll admit that I know nothing about it.
I'm with Robin Becker on thi
On Tue, 26 Jun 2007 11:11:39 +0100, Robin Becker wrote:
> I have seen this sort of evolution strategy in the past and it's very wrong
> to
> attempt to simplify outside the genetic framework. The implication is that
> you
> know better than the overall fitness requirement. The additional expre
> Hi,
>
> Are there any libraries for manipulating algebraic expression trees?
> In particular, take an expression tree and simplify it down.
>
> I'm working up the next release of PyGene, the genetic programming and
> genetic algorithms library.
>
> Part of PyGene works with trees holding algeb
