Is poly-time functions class recursively enumerable?

		Domain Name Forum > Web Design & Development > Programming > Computer Science
Is poly-time functions class recursively enumerable?

Thread Tools

Display Modes

03-12-2011, 01:45 PM

webdev

Senior Member

Join Date: Jun 2009

Posts: 7,868

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...

__________________
Website Development
Domain Name Forum

« Previous Thread | Next Thread »

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is Off Forum Rules

Forum Jump

All times are GMT -4. The time now is 07:09 PM.

| Webmaster Forum | | Domain Name Forum |