Page "Analysis of algorithms" Paragraph 3

Exact ( not asymptotic ) measures of efficiency can sometimes be computed but they usually require certain assumptions concerning the particular implementation of the algorithm, called model of computation.

A model of computation may be defined in terms of an abstract computer, e. g., Turing machine, and / or by postulating that certain operations are executed in unit time.