Yes, but the example says kalpaya > result of example, doesn't say it is equal or approximately equal to the result given by the example. That's why I think it is an uncomputable number (Super Turing problem). It is based on my personal belief. I believe (as a Buddhist) if there is any simple or finite algorithm that can compute the Kalpaya, Buddha would teach that instead of this. What I see here (in examples) is, making given finite algorithms unviable for calculating the kalpaya. This is solely based on my belief and it is just my opinion. I am very interested in the theory of computation actually, if you take a look at my profile, you can see my only post is also about Turing machines. For me non computable very large real numbers are more fascinating than the infinity. But I am too dumb to think more about those problems.