FM@DACTH51.BITNET (04/16/89)
A while ago somebody, I think one of the authors, K. Lang or B. Pearlmutter, posted a arcticle saying that a new release of OakLisp is available. I don't have this article anymore, but anyhow it would be pretty useless since I can't ftp. Does somebody know a way I can get Oaklisp over BITNET ? I really like the ideas in Oaklisp and I can't wait to play with it. In that same article the author claimed they have a fast long integer arithmetic. The multiplication works in O(N^1.59). As an example he used the naive way to compute factorial(1000). That seems a little bit strange to me. The only O(N^1.59) multiplication that I am aware of is Karatsubas method. If you look at it closely, it is a O( N^.59 M ) algorithm, where N is the size of the smaller number and M is the size of the larger number. Thus you don't gain anything if you multiply a large number by a small one, which is what you do all the time if you compute factorial(1000). Comments anybody ?
FM@DACTH51.BITNET (04/19/89)
Oops, sorry. Actually my article was intended for scheme@mc, which I think is the right newsgroup, given that Oaklisp is an object oriented language that contains Scheme as a subset. One thing however strikes me. Today my mail, which obviously made it into the newsgroup came back. The mail daemon at ists.ists.ca returned it because some user, I couldn't figure out which, was unknown. I wonder whether the same thing will happen with this mail. So, lets move to scheme@mc, Martin. ! Martin Schoenert, martins@rwthinf.uucp, fm@dacth51.bitnet, +49 241 804551 ! ! Lehrstuhl D Mathematik, RWTH, Templergraben 64, D 51 Aachen, West Germany !