Oh, Rory, Dude...get help! :-)

Unable to pass comment until you do one about someone I've heard of. It all depends how close to the wind you want to sail.

If Michael Jackson were a coder...

OK... I'll admit it.

This one's a little "weird."

Fortunately, the inside of my brain is only like this for most of the day.

There's that peaceful respite during the fifteen minutes of sleep I get each night that is, oh, so sweet.

Ahhh... The things that keep you sane...

Dominic -

"If Michael Jackson were a coder..."

He's one of the ones I had already sketched out in my noggin.

So, there could very well be an MJ strip on the way :)

I definitely wanted to do him (not like that (you know what I mean (get your head out of the gutter (and pass me the Mad Dog while you're down there)))).

Heh heh heh!!

I saw that episode, and your comic is spot on! I'm having to dry my eyes I'm laughing so much!

mmm Mad dog, University life comes flooding back to me!

"Died of melting"
hahahahaha, thats GOLD!

Yet another Rory convert, Chris Anderson: http://www.simplegeek.com/PermaLink.aspx/a817105b-237d-4b68-8efa-6f1a775f810c

Other coders I'd like to see:

Bill Clinton
Ozzy Osbourne
Britney Spears
Larry Ellison
Mr. T

This tablet pc was a bad idea!!!

My God that was funny.

There must be something wrong with me....

Stop! Stop! Too funny! Too painful to read! My sides hurt!

Somebody please take Rory's tablet away. It's a dangerous weapon.

How about Bill Gates ... if Bill Gates were a coder! HAHAHA, That's GOLDEN!

Bill Gates? Now that's just scary! If HE were a coder we'd have crappy rip off programs that don't work. They'd be hacker's havens - I'll bet my buggy that Bill would even give his software a silly name like 'Windows' or something along those lines.

Anyone interested in Theoretical Mathematics?

Let C be a countable set and F a non-empty finite set.

Prove that the set of all functions from F into C is countable.

Next prove that the set of all functions from C into F is uncountable.

DonXML -

"Larry Ellison"

Hmmm... :)

I'm rather liking that one.

ZooBear and Zop -

"How about Bill Gates"

"Bill Gates? Now that's just scary! If HE were a coder we'd have crappy rip off programs that don't work."

As a Microsoft dittohead blogger, I'm afraid that I cannot let such comments go by without comment.

And I'd like you to know that you are both *naughty*!

Naughty, naughty, naughty!

Have you given up on C# and started programming in LISP?

"Have you given up on C# and started programming in LISP?"

I think in nested parenthesis :)

Rory: you're precious! Keep it up.

Rory thanks for keeping us sane and laughing while we struggle to keep up with what is starting to feel like 400 new microsoft developer releases to learn a day.
yes - naughty naughty naughty
julie

I thought finite sets _are_ countable (?). In which case, I'd love to see the second proof ;)

BTW, how about George W. Bush as a coder?

"BTW, how about George W. Bush as a coder?"

I was definitely thinking along those lines myself :)

"Naughty, naughty, naughty!"

Ah, thank goodness it's still the naughties! ;) This 21st century is going by too quickly.

Gates is actually a great coder. His work is still at Harvard. If you look at some of the memory management code, its pure genius.

> I thought finite sets _are_ countable (?).
> In which case, I'd love to see the second
> proof ;)

Yes, they are - but I'm referring to the set of functions whose domain is F (C for part 2) and whose range is C (F for part 2).

Part 1: The set of all functions from F to C is countable. Let F have n elements - one function can be represented as an n-tuple of elements from C. Since C is countable, the set of n-tuples is also countable. Imagine:

1. The set of n-tuples that contains only the 1st element of C.

2. The set of n-tuples that contains both the first and 2nd elements of C.

et cetera.

There is a countable number of these and each one is countable (since it is finite) - and the countable union of countable sets is countable.

For part 2:

This is essentially the set of all subsets proof using cantor's diagonalization argument.

Imagine the finite set has two elements (if it has more then there are more functions from C into F)

Enumerate C and start creating functions, putting an X in spot i if C[i] is mapped to the first element of F and nothing on spot i if C[i] is mapped to the second element of F. Now take the compliment of the diagonal of this enumeration - there is no function that will perform this mapping. It is uncountable.

Ahh.. I was afraid that Cantor was going to zing me when I was considering his proof that reals are uncountable (same diagonalization idea), but I wasn't sure I understood it. Nice work, Mathematician.

I took Theory of Computation in College too, and even attached Lisp programs to the proofs I had to submit that demonstrated the principles involved (just for fun.)

And I always thought Georg Cantor was a sharp tack, from my pure mathematics days. When it comes to counting infinite sets, he was The Man.

I'm just glad that never affected my ability to appreciate cheap television that involves fine, sexually promiscuous blondes...

do not find it funny

What about Arnold Schwarzenegger?

that was one of the most gayest things i've ever seen!!! and don't you think it was a little harsh , i mean god it was a t.v show ,she wasn't really acting like that so i think u should just grow up!!

Defined By Code

<a href="http://233c9d.com">3663cc</a> | [url=http://2a67c4.com]2e9003[/url] | [link=http://568771.com]0bcc7e[/link] | http://69690a.com | 013f54 | [http://4f92ec.com cc7444]

<a href="http://3edf91.com">b64728</a> | [url=http://019b74.com]343954[/url] | [link=http://a569e6.com]bcf9a8[/link] | http://1120c7.com | ec3302 | [http://e3f90c.com 04d6c0]

164709472 <a href="http://www.730258178.com">730258178</a> http://www.132519531.com

1

164709472 [url=http://www.358892822.com]358892822[/url] http://www.132519531.com

1