L = {<M>|L(M) contains all even legth words}
How can I show that L is not in RE?
yakovm
36
Light Poster
Recommended Answers
Jump to PostYou could use the unsolvability of the halting problem.
All 3 Replies
Rashakil Fol
978
Super Senior Demiposter
Team Colleague
You could use the unsolvability of the halting problem.
yakovm
36
Light Poster
You could use the unsolvability of the halting problem.
HALT is in RE and this language is not
Rashakil Fol
978
Super Senior Demiposter
Team Colleague
HALT is in RE and this language is not
What is HALT?
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.