Honest bounds for complexity classes of recursive functions

A new simplified proof of the McCreight-Meyer Honesty or Naming Theorem is given. Let t be a recursive function, and let F(t) be the set of recursive function computable within time bound t. Then it is shown that an honest recursive t′ can be found which is arbitrarily large on a dense set of arguments such that F(t) = F(t′).