> > > As it is right now, I'm just slowly writing my own (GPL) sub-genius
> > Ok, well tell me when you finish it, and we'll start on the genius
> > sym-manip.
>
> Very cool. Is the sym-manip dependent on the semigroup stuff or vice
> versa? My sub-genius is a little weak on adding new "numbers" like
> interval arith. or arbitrary semi-groups. If I had a stronger base to
> work on, the compiler could be alot simpler. Right now type conversions
> and other type issues are dominating my problems. If the semigroup stuff
> could alleve that, I'd be very happy to work with it.
vice versa - the approach I'm following is to use an AI search algo(A* or
variant thereof) to reduce 'words' to the basis for that field e.g.
define
ab == aaa
a^4 == a
then:
baba => baaaa
=> ba
and defining
E (hmm, how do I get an 'there exists')
\exists x s.t. a = ex \forall a \in S
ee == e
then:
ea => e(ex)
=> ex
=> a
The stop condition is somewhat difficult.
njh
Received on Wed Sep 08 1999 - 04:58:02 CDT
This archive was generated by hypermail 2.2.0 : Sun Apr 17 2011 - 21:00:02 CDT