Talk:Tetration/Code/HolomorphicBaseSqrt2v01: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Dmitrii Kouznetsov
(new algorithm for the same figure)
 
imported>Dmitrii Kouznetsov
mNo edit summary
 
Line 5: Line 5:
The algorithm is optimized for size of code and for the human readability (not for memory and not for speed), but it works!
The algorithm is optimized for size of code and for the human readability (not for memory and not for speed), but it works!
One can make the similar algorithm for other values of base, not only for b=sqrt(2).
One can make the similar algorithm for other values of base, not only for b=sqrt(2).
Please let me know if you find it useful, or if any problems with compiling, or if any questions. [[User:Dmitrii Kouznetsov|Dmitrii Kouznetsov]] 10:46, 24 March 2009 (UTC)
Please let me know if you find it useful, or if any problems with compiling, or if any questions. [[User:Dmitrii Kouznetsov|Dmitrii Kouznetsov]] 10:46, 24 March 2009 (UTC) P.S. I forgot to say, that the code is in C++, and the comments are in English.

Latest revision as of 05:47, 24 March 2009

I just uploaded the new version. It generates almost the same image; so, I do not update the image. The new algorithm is supposed to give 14 correct decimal digits; I have tested it with Mathematica and with Maple. Also, I expect, it can be used in any other programming language with minimal modifications. I had run it under Unix and under Macintosh; I expect it to generate the same image with other operational systems too. The algorithm is optimized for size of code and for the human readability (not for memory and not for speed), but it works! One can make the similar algorithm for other values of base, not only for b=sqrt(2). Please let me know if you find it useful, or if any problems with compiling, or if any questions. Dmitrii Kouznetsov 10:46, 24 March 2009 (UTC) P.S. I forgot to say, that the code is in C++, and the comments are in English.