3 ms·
> However, the numerical value of K is notoriously difficult to calculate to high precision, so computation of more digits get increasingly slower. It can be c
by fdej 10y ago
> However, the numerical value of K is notoriously difficult to calculate to high precision, so computation of more digits get increasingly slower.
It can be calculated to n digits in O~(n^2) time, which isn't really that bad. Something like Brun's constant or the area of the Mandelbrot set is probably a better example of a real number that is "notoriously difficult" to compute.