wbhart

65 ms·

511.
by wbhart 15y ago
Mostly it doesn't actually work. But the one trivial example I tried the berp interpreter was something like 1000 times slower than Python.
512.
by wbhart 15y ago
I finally got it to build, after rebuilding most of Haskell. It crashes on just about everything. Even a simple "for" loop defeats it. So one has to replace all of those with while blocks. Every single one of the Python benchmarks I have pr
513.
by wbhart 15y ago
There is a workaround for the issues with language-python. One can do: cabal fetch language-python cabal unpack language-python edit the language-python.cabal file updating the containers dependency to 0.4.0.0 then change the version number
514.
by wbhart 15y ago
After three hours of trying to install this with GHC 6.12.1 and GHC 7.0.3 I have given up. The problem isn't with berp .cabal files but with dependencies of berp. ghc-7.0.3 requires containers ==0.4.0.0 language-python requires containers
515.
by wbhart 15y ago
There is a commit to the new-identity branch on Oct 19th 2011.
516.
by wbhart 15y ago
I understand. Of course you can also multiply 32 x 32 -> 64 bits in Javascript. But of course you need more than one operation to do it.
517.
by wbhart 15y ago
A serious bignum library wouldn't use base 10. I understood that he intended that you use base 10^15 or something like that. And even that was only by way of illustration. A more standard approach when using doubles would be to use base 2^3
518.
by wbhart 15y ago
For my purposes I need a bignum library with an FFT, assembly optimisation, a bignum format based on full 32/64 bit words and the latest algorithms for performance. If I don't want this to become a multi-decade effort I have to compromise s
519.
by wbhart 15y ago
One big interruption is that I have been writing an FFT implementation completely from scratch that can eventually be used in BSDNT. You can find the code here: https://github.com/wbhart/mpir-fft For the time being it is implemented again
520.
The beginnings of a BSD licensed bignum library(wbhart.blogspot.com)
13 points by wbhart 15y ago|4 comments
521.
by wbhart 15y ago
Here is a javascript bigint library by Leemon Baird http://www.leemon.com/crypto/BigInt.js It's about the best I've seen and embodies all the principles that are being explained by Matt.
522.
by wbhart 15y ago
That's quite standard. The sign can be taken care of separately if one wishes. The reason for putting the least significant digit first is that carries accumulate towards the most significant digit in ordinary arithmetic. Thus many of the s
523.
by wbhart 15y ago
Thanks for changing the title.
524.
by wbhart 15y ago
Shouldn't this be "faster tone detection algorithm". I don't see how to perform a convolution with this algorithm, which I would be able to do if it was an FFT. There are many algorithms for FFT that are faster, e.g. the split radix FFT, Ge
525.
by wbhart 15y ago
A lot of languages fill a much needed gap in the universe.
526.
by wbhart 15y ago
Oh yeah. That's an optimisation more languages should use. But he clearly doesn't do much mathematics if he thinks most integers are array indices. His point is doubtlessly right in his problem domain though and maybe even for a large secto
527.
by wbhart 15y ago
In fact I've implemented precisely that first tradeoff in a library and it isn't too bad. It's still much slower than machine words though. In Dart this becomes more constrained as it uses dynamic typing. Apparently the types specified by t
528.
by wbhart 15y ago
Douglas Crockford details a pile of problems with Javascript that have plagued it since the year zero. Dart needs to fix all these issues. Moreover Google really pitched it as a better language than Javascript. So far the Dart implementors
529.
by wbhart 15y ago
From the Dart documentation: "Integers are not restricted to a fixed range. Dart integers are true integers, not 32 bit or 64 bit or any other fixed range representation. Their size is limited only by the memory available to the implement
530.
by wbhart 15y ago
This is not about the lack of 64 bit integers. Dart can have 32 bit or 31 bit or 30 bit integers or whatever it wants. But mathematically it doesn't make sense to have an int type which does not represent integers consistently. Clearly Java
531.
by wbhart 15y ago
Hmm. print('${(1<<31)}'); -2147483648 (correct value is 2147483648) print('${(1<<30)+(1<<30)}'); 2147483648 (correct) print('${(1<<30)+(1<<30)+(1<<30)+(1<<30)}'); 4294967296 (correc
532.
by wbhart 15y ago
The title conjures images of a person breaking a macbook as a symbol of breaking up with Apple now that Steve is gone. Instead it is a truly beautiful tribute. Something like "Steve remembered in macbook pieces" would seem like a fitting ti
533.
by wbhart 15y ago
I find this list quite striking. Actually I've not seen those particular topics all listed in one place before. I have to admit I am slightly interested in the psychology of that list. Would this list be immediately on the mind of someone w
534.
by wbhart 15y ago
I'm unsure about the Scheme that is included. It claims to be R6RS which requires support for exact numerical operations including big integers and rationals. Currently it seems to use only double precision floating point instead of exact i
535.
by wbhart 15y ago
When I read the first letter I carelessly didn't check the header and assumed that it was the "UK government response..." that you spoke of. I thought, wow, someone in our government is really switched on. They've cross referenced their let
536.
by wbhart 15y ago
As coincidence would have it, a friend just announced to me that he has written code to compute the number of partitions of 10^12 in 109 seconds.
537.
by wbhart 15y ago
Some months ago I observed an object crossing the sky at night from Coventry UK. It crossed the entire extent of the sky in about 2 seconds. It was very high up and had a red glow like that of a jet afterburner. It didn't fade out or change
538.
by wbhart 15y ago
If it were truly British then upon an exception it would apologise excessively and offer to dust you off. Queues would also be ubiquitous. Data could not be accessed in order, but would have to be retrieved from an unordered queue, which wo
539.
by wbhart 15y ago
1.5D would have added that half-realistic quality which is sadly lacking in this unrealistic shadow game.
540.
by wbhart 15y ago
No, this is not stretching the definition at all. There is no way to recreate the source of the parser generator from the automatically generated parser and grammar files. And in fact it would be entirely non-trivial to recreate it. The par

More ›