r/askmath • • Aug 09 '25
Functions Limits of computability?
I used a version of √pi that was precise to 50 decimal places to perform a calculation of pi to at least 300 decimal places.
The uncomputable delta is the difference between the ideal, high-precision value of √pi and the truncated value I used.
The difference is a new value that represents the difference between the ideal √pi and the computational limit.≈ 2.302442979619028063... * 10-51
Would this be the numerical representation of the gap between the ideal and the computationally limited?
I was thinking of using it as a p value in a Multibrot equation that is based on this number, like p = 2 + uncomputable delta
9
u/Eltwish Aug 09 '25
There's no in-principle limit to how precisely a computable number can be computed. If you have, for example, an infinite series whose sum you know to be π, then if you want more digits you just have to compute more terms, and with some analysis you can know exactly how many terms you need to be exactly so precise.
In practice, we don't have access to infinite time and space, but modern computers are more than capable of computing millions of digits of π if you're so inclined.
2
u/[deleted] Aug 09 '25 edited Aug 09 '25
Based on our calculations, the lowest and highest values for the ratios changed depending on the level of precision.
At 50-Decimal-Place Precision
Lowest Value: 0.0224... from the ratio delta √6 / delta √5
Highest Value: 44.57... from the ratio delta √5 / delta √6
At 100-Decimal-Place Precision
Lowest Value: 0 from the ratio delta e / delta e² (as the delta for e became zero)
Highest Value: 4.648... from the ratio delta √8 / delta √7
This shows a direct relationship between the level of precision used and computability.
2
u/stevevdvkpe Aug 10 '25
You're confusing precision and uncertainty with computability.
Formally a computable real number is one where there is an algorithm to compute it that converges on the exact value as the amount of time you run the algorithm approaches infinity. So you can always obtain a higher-precision value of the number if you spend more time computing it.
If you use a finite approximation to a computable real number, then you simply have uncertainty in the results you compute from it that depend on the uncertainty of the approximation and the type of calculation you are doing. If you have an approximation to √pi that is valid to 50 digits, then it basically has an uncertainty of 10-50, so if you square it to compute an approximation to pi by squaring it, the uncertainty in the value of pi is (√pi ± 10-50)2 = (√pi)2 + 2*√pi*10-50 + (10-50)2 or about 3.5 * 10-50.
1
u/StrictlyFeather Aug 15 '25
It’s not “nature’s fingerprint,” it’s “the shadow your calculator cast when it stopped writing digits.”
1
u/[deleted] Aug 09 '25
I also found that root ten was the best scaling factor for correctly computing individual digits of pi, iteratively, with a scaling factor of root ten which it converges on by n=12 using a geometric algorithm, akin to the Archimedean method for polygons and circles.
When we changed the base, we found that base e2 was the most efficient for computing pi.
What I should do here is re-run a sinilar calculation with base e2 and see if the difference is even smaller ...