Non-deterministic Time Hierarchy Theorem
If g(n) is a time-constructible function, and f(n+1) = o(g(n)), then there exists a decision problem which cannot be solved in non-deterministic time f(n) but can be solved in non-deterministic time g(n). In other words, the complexity class NTIME(f(n)) is a strict subset of NTIME(g(n)).
Read more about this topic: Time Hierarchy Theorem
Famous quotes containing the words time, hierarchy and/or theorem:
“Lest darkness fall and time fall
In a long night when learned arteries
Mounting the ice and sum of barbarous time
Shall yield, without essence, perfect accident.
We are the eyelids of defeated caves.”
—Allen Tate (1899–1979)
“In the world of the celebrity, the hierarchy of publicity has replaced the hierarchy of descent and even of great wealth.”
—C. Wright Mills (1916–1962)
“To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
—Albert Camus (1913–1960)