Question 1: Is it possible to create an algorithm for deterministic Turing machine that will run not in P neither EXPTIME?
For me it seems that the answer for my question is
it is impossible. If my reasoning is correct, it means that any function that describes complexity will have
Does my reasoning is correct?