Re:Show HN: Pi Approximation using Monte Carlo
by darkmighty on Sunday August 10, 2014 @05:05AM
(#8159268)
I believe the error should be (roughly) ~ size of f.p. interval at 1 * pi ~ pi* 2^(-32/64), i.e. barely representable. Number of steps would be ~ 1/(error^2) ~ 2^(2* 32/64).
Even giving 50% probability at the line the result would be minutely biased because of many other things involving the discreteness of the floating point arithmetic. A less biased version would have to maybe increase the resolution around the boundary as number of steps progresses.
Re:Show HN: Pi Approximation using Monte Carlo
by MrQuincle on Sunday August 10, 2014 @05:52AM
(#8159338)
Thanks!
Practically, it might be fun to have a small library that artificially reduces the precision of floating point numbers. I've never heard about such a thing though.
Even giving 50% probability at the line the result would be minutely biased because of many other things involving the discreteness of the floating point arithmetic. A less biased version would have to maybe increase the resolution around the boundary as number of steps progresses.