06/17/2021, 04:29 AM
(This post was last modified: 06/17/2021, 04:59 AM by Ember Edison.)
(05/21/2021, 03:44 AM)JmsNxn Wrote: I'm surprised by how simply you can construct Tetration in Pari; all I really used was a couple for loops, and a couple if statements; and a whole swath of recursion. This is significantly more elementary than Sheldon's fatou.gp; so expect more glitches. I also have a strong feeling this is not Kneser's tetration. It appears to be diverging for large imaginary arguments; which can only happen if it isn't normal as the imaginary argument grows; which Kneser's solution tends to L.
We use Pari not only because it is simple, for example, in Wolfram Mathematica, a lot of large number operation (like exp/log) will make it memory overflow.
I'm very angry when I say it...Tetration is one of the most important fractal functions. Wolfram, what shit did you do?
I don't want to say that Pari is perfect(like abs(x) < 1E-1000000 and calculation log(x) ), but at least it won’t fuck down my windows
