I'm pretty sure this question hasn't been answered here, or even asked, so I think I should ask it. In computer science, whatIn Michael Sipser's Theory of Computation on page 270 he writes:
P = the class of languages for which membership can be decided quickly.
NP = the class of languages for which membership can be verified quickly.
What is the difference between "decision""decided" and "verification""verified"?