Recursion theoretic characterizations of complexity theoretic properties

In this paper we exhibit recursion theoretic characterizations for two types of r.e. complexity sequences and use these characterizations to prove interesting facts about the classes of sets (or functions) possessing such complexity sequences.