Is poly-time functions class recursively enumerable?
 

Hi. If I define Poly-time functions, the functions that are computable by a turing machine in maximum polynomial(n) time, which n is size of input. Is the class of these functions recursively enumerable? I think that this Poly-time is the famous P-class in complexity,but as I searched I didn't...