Martin Rubey <[email protected]> writes: | Ralf Hemmecke <[email protected]> writes: > | >>>> For TaylorSeries some results are exact, and it is easier to control | >>>> approximation error. | > | >>> It's still not a Ring. | > | >> Hm, but when removing "=", it is a ring, no? | > | > Good. Then tell me what a "ring" is. You can restrict to | > "multiplicative monoid" if you like. To clarify what we are talking | > about, tell me what "MartinMonoid" is and how it relates to | > http://en.wikipedia.org/wiki/Monoid#Definition . | | Just that = is not computatble doesn't mean that it's not existent.
if it is not computable, how do you propose to check that the other operations do verify ring axioms? | Thus, associativity in MartinMonoid guarantees that | | (a*b)*c and a*(b*c) how do you guarantee that? Is i a God's act? | will be equal, but it does not mean that FriCAS can prove this equality. yes, but exactly how do you guarantee that? -- Gaby -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en.
