title: P != NP question
body: <p>Not a 'pure' programming question, but since it is deeply involved in programming theory, I thought it best to ask here.</p>
  
  <p>Regarding the P NP problem, this excerpt from <a href="http://en.wikipedia.org/wiki/P_versus_NP_problem" rel="nofollow noreferrer">http://en.wikipedia.org/wiki/P_versus_NP_problem</a> : "In essence, the question P = NP? asks: Suppose that yes answers to a yes or no question can be verified quickly. Then, can the answers themselves also be computed quickly?"</p>
  
  <p>I am left wondering, how is the speed of verifying an answer related to the speed of generating a solution?</p>