I have actually written some working code in Haskell, mostly for solving Project Euler problems and providing programs for OEIS sequences. There *is* something slippery about it. But I can mostly read the code in that paper -- though I couldn't begin to tell you why it works. I'm tempted to write that e algorithm in Haskell; I think it's a one-liner. On Thu, Feb 12, 2015 at 10:17 AM, Fred Lunnon <fred.lunnon@gmail.com> wrote:
Intriguing conjecture therein ... RWG ?
I have to confess to finding the Haskell programming language hopelessly slippery, despite having some familiarity with LISP and PROLOG, and notwithstanding the best efforts of the amiably hyper Simon Peyton-Jones' videos on YouTube.
Anybody else have this problem?
WFL
On 2/12/15, Victor Miller <victorsmiller@gmail.com> wrote:
The following update is also really interesting:
Unbounded Spigot Algorithms for the Digits of Pi
http://www.cs.ox.ac.uk/jeremy.gibbons/publications/spigot.pdf
On Thu, Feb 12, 2015 at 2:35 AM, Joerg Arndt <arndt@jjj.de> wrote:
* Keith F. Lynch <kfl@KeithLynch.net> [Feb 12. 2015 08:19]:
[...]
Can anyone write an equally short c program to print the first thousand decimal digits of any other interesting irrational number, such as pi, phi, zeta(3), cos(x)=x, ln(2), gamma, or sqrt(2)?
Stanley Rabinowitz, Stan Wagon, A Spigot Algorithm for the Digits of $\pi$, The American Mathematical Monthly, vol.102, no.3, pp.195-203, (March-1995).
http://www.mathpropress.com/stan/bibliography/
Best regards, jj
[...]
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun