On page 348 of Sipser M. Introduction to the Theory of Computation. Cengage Learning; 2012 Jun 27, it saysPerhaps at some time in the future, methods that can quantify the complexity of finite problems will be developed. But current methods are asymptotic and hence apply only to the rate of growth of the complexity as the problem size increases --- not to any fixed size.My question is, are such methods developed currently?
Are there any methods to quantify complexity of finite problems?
complexity theory;time complexity