The time required by a deterministic Turing machine M on input x is the total number of state transitions, or steps, the machine makes before it halts and outputs the answer ("yes" or "no").
The time required to output an answer on a deterministic Turing machine is expressed as what?
state transitions