Tim, sorry, I do not understand what you mean here. Do you argue that it is not possible to write a relatively fast implementation of, e.g., Pollard's Rho algorithm in Julia.
On Sunday, March 15, 2015 at 2:19:47 PM UTC+1, Tim Holy wrote: > > It's more than a question of which algorithm to use: the immutability of > numbers means that every single bignum addition or multiplication requires > allocation. So currently, julia is going to have a hard time competing > with a > hand-rolled method that allocates a cache of numbers to (re)use as scratch > space for calculations. You can do this if you're willing to manage all > these > temporaries manually. > > The best solution would be to make julia smart enough to do that "behind > the > scenes." This is a very interesting but nontrivial problem (with potential > costs if it's "close but not smart enough"). > > --Tim > >
