3 ms·
He's comparing apples to apples. Kolmogorov complexity for different ways to approximate п is more or less flat at bang for the buck.
by guard-of-terra 14y ago
He's comparing apples to apples.
Kolmogorov complexity for different ways to approximate п is more or less flat at bang for the buck.
- finnw 14y agoStrictly speaking it is not Kolmogorov complexity (That has an upper bound, namely the constant size of a program that can output arbitrarily many digits of Pi.)
- beefman 14y agoKolmogorov complexity requires a standard Turing machine to measure -- switching notations isn't allowed. Rational approximations to Pi (or any other irrational number) vary substantially in terms of accuracy/size, which is why many standard libraries include functions for computing convergents.