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 find anything discussing wether this class is RE....My question comes from here:I read that the class of recursive functions is not RE,so I thought that maybe it's subclasses would be,the most natural subclass that came to my mind was this Poly-time functions class...
Thanks very much.