229
A ____ walks into a bar - April 29, 2010Rating: 4.4/5 (9 votes cast)
Facebook Page // Twitter Page
14 Comments
Leave a comment
Profile pictures are tied to your email address and can
be set up at Gravatar.
Click here for recent comments.
(Note: You must have javascript enabled to leave comments, otherwise you will get a comment submission error.)
(Note: You must have javascript enabled to leave comments, otherwise you will get a comment submission error.)
P = NP ?
P union N? hmm
Shouldn't that be P ⋂ N?
Show: P ⋂ N = Ø
P ⋂ N = {X : X∈N AND X∈P}
P ∪ N = {X : X∈N OR X∈P}
X is a narrative => X is not a profession.
Thus: P ⋂ N = Ø
Q.E.D.
Exactly, we don't want any "walks into a bar" joke.
Well done sir, well done.
Well done indeed. That's simultaneously the worst and greatest pun I've ever seen.
you forgot to divide by the subspace of puns whose humor is zero (to show you can divide by it, it's the kernel of the map f(j)=h, where h is the humor level of the joke).
Ok... what were the chance that you post a "A guy walk into the bar" at sametime than http://buttersafe.com/2010/04/29/a-guy-walks-into-a-bar ?!?
Neato!!
Given there are like 10,000 webcomics and about 100 different types of jokes, I'd say the probability is pretty high that two do a similar joke on the same day.
but you have 229 comics O.O
The commented combinations (intersection and union) don't apply. N is a narrative, not a set of naratives. If N were a set, the proper combination would be cross-product.
Gary, it's your fault I have nothing interesting and new to say now.
Also, I'm happy that there is someone out there, in this cruel math world, who doesn't let puns subvert definitions.
One more thing, note that nothing in my sentence criticizes people that let, it's just a compliment to Gary.
If there are only 100 types of jokes and a webcomic delivers a joke a day, you only need like 13 webcomics to have some two of them share a punchline at any given day more often than not. Go birthday problem, go!