On Saturday, August 23, 2014 9:26:55 PM UTC+2, Aaron Meurer wrote: > > For example, an addition of n terms has 2**n sub-expressions of just > taking all possible combinations of terms to make smaller additions (that > doesn't even count the subexpressions of the terms themselves). That also > doesn't consider that you might want to consider something like x + x as a > "subexpression" of 3*x. > > Maybe if you get some genetic programming algorithm to work, it could avoid the need to explore all the combinations. The problem is to make it converge towards the solution.
-- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/0872bb17-6ffd-42bd-8ec6-02bc2b08d1f3%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
