> Suppose it runs faster than O(2^(2^N)). That is, two to the power of two to the power of N, a very large number.
~~While probably meant to simply, this statement sort-of undermines the author's credibility. I mean the "a very large number" part. Correct me if I'm wrong, but surly he means "a very fast growing function".~~
Or - it seems he mean the the program completes in less than O(2^(2^N)) steps.
~~While probably meant to simply, this statement sort-of undermines the author's credibility. I mean the "a very large number" part. Correct me if I'm wrong, but surly he means "a very fast growing function".~~
Or - it seems he mean the the program completes in less than O(2^(2^N)) steps.