Talk:Total circles area: Difference between revisions

Content added Content deleted
No edit summary
Line 109: Line 109:
::In contrast, the C coded Monte Carlo method takes 100 million points to compute 21.56262288. --[[User:Paddy3118|Paddy3118]] 15:15, 22 September 2012 (UTC)
::In contrast, the C coded Monte Carlo method takes 100 million points to compute 21.56262288. --[[User:Paddy3118|Paddy3118]] 15:15, 22 September 2012 (UTC)
::With 100 million points, the Python VdC area estimate is 21.565056432232886. --[[User:Paddy3118|Paddy3118]] 15:24, 22 September 2012 (UTC)
::With 100 million points, the Python VdC area estimate is 21.565056432232886. --[[User:Paddy3118|Paddy3118]] 15:24, 22 September 2012 (UTC)
::: Maybe you want to write part of such information inside the page, instead of just here.


== C89 vs C99 ==
== C89 vs C99 ==
Line 121: Line 122:


: If the 2X speed decrease you are seeing is real (and I can't reproduce it), I suggest you to create a bug report for GCC devs, to help them fix the situation in the right place, inside GCC, instead of inside my code. --[[User:Bearophile|bearophile]] 12:13, 25 September 2012 (UTC)
: If the 2X speed decrease you are seeing is real (and I can't reproduce it), I suggest you to create a bug report for GCC devs, to help them fix the situation in the right place, inside GCC, instead of inside my code. --[[User:Bearophile|bearophile]] 12:13, 25 September 2012 (UTC)

==Excessive digits==
Maybe it's worth explaining after the Task description how the many digits of the reference answer were computed. Have you used this http://hackage.haskell.org/package/hmpfr with the Haskell analytical solution? --[[User:Bearophile|bearophile]] 11:22, 1 October 2012 (UTC)