which accepts an integer of arbitary length as an input and takes maximum polynomial time to execute , let us define a language L= {n | P does not crash for any input of size n}
How is easy or difficult to prove that L belongs to NP ?
Are you able to help answer this sponsored question?
Questions asked by members who have earned a lot of community kudos are featured in order to give back and encourage quality replies.