Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

In field of computational complexity there is a definition of time constructible function.

As example, in any reasonable and general model, functions like $t_1(n) = n^2, t_2(n) = 2^n$, and $t_3(n) = 2^{2^n}$ are computable in $poly(\log t_i (n))$ steps.

I would to know why it's exactly $poly(\log t_i (n))$ steps?

How can I show it?

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.