The last meeting with Matthew implanted a really cool idea about solving
equations. Suppose we have an equation f(x) which has finitely many solution
a1, a2, a3, ... an. Then we can say that the solutions of equation f(x) = 0
are
equivalent to the solutions of the equation `(x - a1)*(x - a2) ... (
I think the solvers should try to abstract two basic ideas:
- Rewriting. You've exposed some ideas here about that. Basically,
rewriting an expression in a way that makes it easier to solve, or to
apply decomposition.
- Decomposition. This means rewriting F(x) as f(g(x)). You then invert
f and g s
On Wed, Jul 2, 2014 at 1:21 PM, Aaron Meurer wrote:
> I think the solvers should try to abstract two basic ideas:
>
> - Rewriting. You've exposed some ideas here about that. Basically,
> rewriting an expression in a way that makes it easier to solve, or to
> apply decomposition.
> - Decomposition.
