complexity function

noun3

1. •
   A function representing the computational complexity an algorithm.

   • Let ϕ be a complexity function. — 2003
2. •
   A function that counts the number of distinct factors (substrings of consecutive symbols) in a string of symbols;

   • We present two constructions of infinite words with a complexity function that grows faster than any polynomial, but slower than any exponential. — 2003
3. •
   a function that counts the number of words of a given length.