The set, the closure of F, is the closure with respect to substitution and concatenation recursion on notation of a set of basic functions comprehending the set F. By improving earlier work, we show that is the substitution closure of a simple function set and characterize well‐known function complexity classes as the substitution closure of finite sets of simple functions.