pilib.e (was: Re: How to handle crashes?)
I haven't added the ability to do ((PI*7)/PI == 7) in fraclib.e,
as it was so complex that it demanded to have its own library.
I'm working on pilib.e, mainly trying to find the best way to represet
PI. Right now, its an 8-length sequence which encodes this algorithm:
(x) + (y*PI) + (PI^z) + (a*(PI^b)) + (c/PI) + (d/(PI^f))
Hence, in order to represent 2PI, you have:
(-1) + (2*PI) + (PI^0) + (0*(PI^0)) + (0/PI) + (0/(PI^1))
That sort of thing is rather unwieldy however, and makes something like 2PI+2PI
a complex computation.
If anyone has ideas on how this could be simplified, feel free to let me know.
jbrown
--
/"\ ASCII ribbon | http://www.geocities.com/jbrown1050/
\ / campain against | Linux User:190064
X HTML in e-mail and | Linux Machine:84163
/*\ news, and unneeded MIME | http://verify.stanford.edu/evote.html
|
Not Categorized, Please Help
|
|
