This would be analogous to the Kolmogorov Complexity of a string, except in this case, I’m interested in the algorithm that solves a given problem using the least number of steps.

We would therefore have to be able to show that any other algorithm is of the same order of complexity as the algorithm in question.

I’m asking because I’m working on a paper that makes use of this concept, and I was surprised when I realized that I’m not aware of any name for this concept, though I’ll concede I’m risking embarrassment if there is such a name, that I’m simply unaware of.