It is probably impossible to provide an algorithm to precisely evaluate the generalized hypergeometric function for all possible parameters and inputs; however, it doesn't hurt to try. Are there nontrivial algorithms which, for any given parameter and input, can instantaneously provide what UI time complexity the computation will be? (The trivial, and completely useless, algorithm declares it will diverge for all inputs.)
No comments :
Post a Comment