turing machine question - Domain Name Forum

		Domain Name Forum > Web Design & Development > Programming > Computer Science
turing machine question

09-11-2009, 06:06 AM

webdev

Senior Member

Join Date: Jun 2009

Posts: 7,868

turing machine question

L = {|L(M) contains all even legth words} How can I show that L is not in RE?

__________________
Website Development
Domain Name Forum

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:40 PM.