Re: [math-fun] Forget about runtimes longer than simple exponential

Warren Smith wrote:

NO ALGORITHM RUNNING IN OUR UNIVERSE CAN TAKE LONGER THAN SIMPLE EXPONENTIAL TIME exp(polynomial(N)) WHERE N IS THE NUMBER OF PARTICLES INVOLVED.

Your universe sounds incredibly boring and nihilistic. I'll continue working in the von Neumann universe instead... Sincerely, Adam P. Goucher