For instance, the set of problems solvable within time f(n) on a deterministic Turing machine is then denoted by DTIME(f(n)).
What is the expression used to identify any given series of problems capable of being solved within time on a deterministic Turing machine?
DTIME(f(n))