Print Page | Close Window

gate 2003 question Printed From: One Stop GATE Category: GATE Previous Years Test Papers - Discuss Here Forum Name: CS Papers Forum Discription: Computer Science Previous Year GATE Papers to can discussed here. URL: http://forum.onestopgate.com/forum_posts.asp?TID=127 Printed Date: 06Feb2025 at 2:44pm Topic: gate 2003 question Posted By: Adhiti Subject: gate 2003 question Date Posted: 02Feb2007 at 11:55am Nobody knows yet if P=NP. Let L= (0+1)* if P=NP = fi(empty set) otherwise. which of the following statement is true. a. L is recursive b. L is recursively enumarable but not recursive. c. L is not recursively enumarable. d. Whether L is recursive or not will be known after we find out if P=NP Replies: Posted By: Alok Date Posted: 02Feb2007 at 4:34pm (0+1)* and epsilon(empty string) both are regular lang. that means both are recursive. whether P=NP or not L will always be recursive!! ans is (A).

Print Page | Close Window