in reply to Re^3: NP-complete sometimes isn't (A benchmark)
in thread NP-complete sometimes isn't

(*)I tried to use the same math to calculate the theoretical time for 1 million value dataset, but nothing I have access to can calculate 2**1e6 in a timeframe that I was prepared to wait for :)
here it is, if you happen to care about the answer. But if your goal is to just rewrite that number as a power of 10, you don't need to calculate it in the first place:
2 ** $y == 10 ** $x log(2 ** $y) == log(10 ** $x) $y * log 2 == $x * log(10) $x == $y * log(2) / log(10)

... which also explains why your estimate is right ;-)

Which if my sleep deprived brain isn't dissin' me, that represents something like 100,000 years of processing.

More in the order of 10e300000 years. The number of seconds per year is about 3*10e7, so it's something like 10e299993 years. In comparison, the universe is about 10e10 years old. When you can do 10e10 calculations per second you're still at 10e299983.