Page "Theory of computation" Paragraph 12

To simplify this problem, computer scientists have adopted Big O notation, which allows functions to be compared in a way that ensures that particular aspects of a machine's construction do not need to be considered, but rather only the asymptotic behavior as problems become large.

So in our previous example we might say that the problem requires steps to solve.