User blog comment:Ikosarakt1/Uncountable function cannot exists/@comment-1605058-20130707061148

Let f(n)=n. One can show that for all alpha and n, f_alpha(n)>n. So each alpha has undefined f-typed complexity. This works for other functions if we assume that they "slow down" infinity often.