tag:blogger.com,1999:blog-9871512.post115775695143433598..comments2022-09-03T20:56:46.577-04:00Comments on Tumbolia: No, not SOAP. We're talking actual soap here.jtohttp://www.blogger.com/profile/03968844388108605008noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-9871512.post-74746864902713837812007-02-13T11:15:00.000-05:002007-02-13T11:15:00.000-05:00Not really. For problem size n=2, n^1000000 is ap...Not really. For problem size n=2, n^1000000 is approximately one googol to the 3000th power. No computer can do <EM>anything</EM> that many times. I don't think it's even possible in principle, unless there are yet-unknown loopholes in the laws of physics.<BR/><BR/>For the sake of comparison, the observable universe contains less than one googol atoms. The age of the universe is maybe 10^17 jtohttps://www.blogger.com/profile/03968844388108605008noreply@blogger.comtag:blogger.com,1999:blog-9871512.post-65553940414214193722007-02-13T10:03:00.000-05:002007-02-13T10:03:00.000-05:00> Who cares if every problem that can be solved in...> Who cares if every problem that can be solved in O(2n) time can also be solved in O(n1000000) time? In practice the latter is probably worse.<BR/><BR/>Depending on the problem size and computer speed.Anonymousnoreply@blogger.com