complexity theory - Are there any problems which requires more than double exponential time? -
are there problems, known algorithms require more double exponential time?
the time hierarchy theorem ensures problems of sort exist. contrived example that's used theorem, consider following problem:
given turing machine m , string x, m accept x within 222n steps?
this problem provably cannot solved tm in under 222n steps, , since tm can simulate computer n6 slowdown, means no computer can solve problem in time o(222n).
granted, isn't interesting problem (i can't see why you'd want solve except in contrived situations), it's known problem requires triple exponential time solve.
hope helps!
Comments
Post a Comment