Turing machine - polynomial time expression

xeon123

In the Turing Machine, the machine accepts a word if the computation terminates in the accepting state. The language accepted by the machine, L(M), has associated an alphabet Δ and is defined by

L(M) = {w [itex]\in[/itex] [itex]\Delta[/itex]}

This means that the machine understands the word w if w belongs to the language.
We denote by Tm(w) the number of steps in the computation of M on the input w. If the computation never halts, then Tm(w)=infinity.

Also, we denote the worst case run time of M as

Tm(n) = max{Tm(w)}

which means the biggest words in the dictionary (I suppose).

But, we say that M runs in polynomial time if there exists k such that for all n, T(n)[itex]\leq[/itex] n^k + k.

I don't understand what n^k+k means. Can anyone explain me the last expression?

Thanks,

Mark44

Your definition for polynomial time seems to be a little off. It's usually defined as T(n) ≤ n^k, without the additional k term that you showed.

If you do a search for "polynomial time" this is one of the links that you'll see: http://www.wordiq.com/definition/Polynomial_time.