|Perl: the Markov chain saw|
Re^2: Monte Carlo - Coin Tossby BrowserUk (Pope)
|on Mar 12, 2011 at 14:38 UTC||Need Help??|
You can use Bit::Vector, but I suspect that would be a good deal slower.
There wouldn't be any need to do that. With 32-bit ints, a full run would take around 7 hours. With 64-bit ints, it would take around 3 million years.
If you switched to using unpack to count the bits:
Then the full 32-bit comes down to a very reasonable 40 minutes, but that still leaves the full 64-bit requiring several hundred thousand years.
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.