T-Rex: God, do YOU like poutine?
God: MAN DOES P EQUAL NP
T-Rex: ...Um. Maybe?

T-Rex: It's kinda the greatest unsolved problem in computer science!

T-Rex: If P equals NP then a whole class of problems are easily solvable! But we've been trying to efficiently solve these problems for years, and so far: NO DICE. But if P doesn't equal NP, why haven't we been able to prove it?
T-Rex: So are you saying "Probably I hate poutine, but it's really hard to prove"? Or - or are you more saying "If I like poutine, then all public-key crypto is insecure"?

Utahraptor: So who likes poutine?
T-Rex: God! POSSIBLY. And the problem is, um, equivalent to the P=NP problem.

Utahraptor: Ah. So the Clay Mathematics Institute has a $1,000,000 prize for the first correct solution to the question "Does God like poutine?"
T-Rex: Yes. As the two problems are equivalent, this is now the world we live in. "Does God like poutine" is the most important open question in computer science today.

T-Rex: Doctor Professor Stephen Cook first pondered whether God likes poutine in 1971; his seminal paper on the subject has made him one of the forefathers of computational complexity theory / God poutine.
T-Rex: ...Actually that's awesome; I'm glad we live in this wicked sweet world!!