Not a computer scientist, but doesn't being NP mean that the problem is decidable in polynomial time, on a non-deterministic turing machine? I happen to know that anything problem that can be decided by a non-deterministic turing machine can also be decided by a turing machine (just slower), so NP problems should be all decidable.
--
Best Regards,
Muhammad Naveed Anjum MC100202262
--
Please visit
http://www.vuexpert.com and get registered for Past Papers, Quiz, Assignments, GDBs and much more...
To post to this group, send email to vu-experts@googlegroups.com
Do write to bilal.zaheem@gmail.com for Help, suggestion and Complaint.
No comments:
Post a Comment