Something that grows faster than NP class of problem does

70 Views Asked by At

I have a theoretical question. F.ex. we have a NP-class of problem, i.e. which do need exponential time on deterministic Turing machine. Is there anything that is growing faster than exponent does. Even if it would be just some theoretical concept. And if such concept is possible to exist, may it exist f.ex. a problem that do correspond to this class.

1

There are 1 best solutions below

1
On

Finding a Hamilton Path for example is in NEXPTIME, and it is known that $NP \subsetneq NEXPTIME$. More preceisly, it can be solved by a nondeterministic Turing machine using time $O(2^p(x))$, where p(x) is a polynomial. A very nice reference is Aaronsons Complexity Zoo.