Blum axioms

In computational complexity theory the Blum axioms or Blum complexity axioms are axioms that specify desirable properties of complexity measures on the set of computable functions. The axioms were first defined by Manuel Blum in 1967.

Importantly, the Speedup and Gap theorems hold for any complexity measure satisfying these axioms. The most well-known measures satisfying these axioms are those of time (i.e., running time) and space (i.e., memory usage).

A Blum complexity measure is a pair ${\displaystyle (\varphi ,\Phi )}$ with ${\displaystyle \varphi }$ a Gödel numbering of the partial computable functions ${\displaystyle \mathbf {P} ^{(1)}}$ and a computable function

...
Wikipedia