17 Dec
2003
17 Dec
'03
9:38 a.m.
Hi
There was a talk at our last svfig ( Silicon Valley Forth Interest Group )
about how to find the interesting integer ratios ( like 355/113 ). Although,
one can simply try all kinds of numbers ( quite quick on todays processors ),
there are algorithms based on number theory that are faster. I wish I was
paying more attention so I could pass on what was done.
The talk was based on creating speciallized languages to handle these
interesting problems of LSD's ( Least Common Denominator ). The fellow
that gave the talk was named LaFarr. Forth is especially adapt at
creating application oriented languages. I fact that is the way
one normally programs in Forth, once they know what they are doing.
Dwight
From: Joe <rigdonj(a)cfl.rr.com>
At 02:43 PM 12/17/03 -0800, you wrote:
On Wed, 17 Dec 2003, Patrick Rigney wrote:
I don't know but 355/113 is easy to remember and is accuarate to about 6
places. That's what we used to use on computer languages that didn't have
PI predefined. (Boy I'm dating myself!)
Joe
Somebody just showed me "Google
calculator". Go to google and enter any of
the following:
0xf342 - 54
38891 in octal
10kg * 4m/s^2
26tbsp
I guess I can throw away my 27S now. :-) --Patrick
Their "complete instructions" suck. They don't even list all of the
operators! (such as your use above of "in octal".
OK,
what is the IEEE floating point representation of PI?
"3.1.459 in binary" does NOT work.