Re: Comments on Spearman and Williams solvable quintics
- From: JohnCreighton_@xxxxxxxxxxx
- Date: 10 Oct 2005 17:53:49 -0700
Richard Fateman wrote:
> 3. Every expression or subexpression of the form x^(1/n) is
> ambiguous potentially. How do you propose to simplify them
> unambiguously.
>
> 4. Solving quintics better is not an important issue in
> the design or implementation of computer algebra systems;
> generally the solutions that come out of the formulas
> using radicals cannot be used for anything else because
> (except in very simplified circumstances) they are too
> complicated in form for the simplifiers to handle, and
> so might as well be opaque "root #n out of m of this
> formula".
>
> Regards
> RJF
I agree strongly with these last to points. Allot of solutions to the
roots of polynomials I have seen on this news group have been pretty
unintelligible. However, I still feel the research is important as I
hold "faith" that CAS in the future will be better able to deal
with long complicated, intelligible and somewhat ambiguous expressions.
.
- Prev by Date: Re: symbolic integration by computer
- Next by Date: Re: MuPAD : linalg::pseudoInverse(Matrix)
- Previous by thread: comp. periods of elliptic curves with MAGMA
- Next by thread: Maxima Set Manipulation Missing In Windows Version
- Index(es):
Relevant Pages
|
|