title: What is the Pumping Lemma in Layman's terms?
body: <p>I saw <a href="https://stackoverflow.com/questions/461539/do-theoretical-computer-science-topics-such-as-regular-vs-non-regular-languages">this question</a>, and was curious as to what the <strong>pumping lemma</strong> was (<a href="http://en.wikipedia.org/wiki/Pumping_lemma" rel="noreferrer">Wikipedia</a> didn't help much).  </p>
  
  <p>I understand that it's basically a theoretical proof that must be true in order for a language to be in a certain class, but beyond that I don't really get it. </p>
  
  <p>Anyone care to try to explain it at a fairly granular level in a way understandable by non mathematicians/comp sci doctorates?</p>