You'll have to clarify your notation in the definition of L...
Computer Science Canada Problem Regarding Recursive Language |
| Author: | ravinder [ Wed Jan 21, 2009 6:16 am ] |
| Post subject: | Problem Regarding Recursive Language |
Nobody knows yet if P = NP. Consider the language L defined as follows: L = f (0 + 1) if P = NP f otherwise Which of the following statements is true? 1) L is recursive (2) L is recursively enumerable but not recursive (3) L is not recursively enumerable (4) Whether L is recursive or not will be known after we nd out if P = NP |
|
| Author: | Brightguy [ Wed Jan 21, 2009 9:43 am ] |
| Post subject: | Re: Problem Regarding Recursive Language |
You'll have to clarify your notation in the definition of L... |
|