Archives
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
- January 2009
- December 2008
- November 2008
- October 2008
- September 2008
- August 2008
- July 2008
- June 2008
- May 2008
- April 2008
- March 2008
- February 2008
- January 2008
- September 2007
- August 2007
- April 2007
- March 2007
- January 2007
Pages
Also Nominated
Essential
Upaya
Categories
Meta
November 2008
Dear Mom
more animals
Family Motto
On Thanksgiving, you can eat something bigger than your head.
Coming Thing
“Doctor, I have an orgasm every time I sneeze.”
“Goodness. What are you taking for it?”
“Ragweed.”
More here.
A Geek’s Thanksgiving
My new piece on Edgelings.
My first Edgelings post
I’m pleased to announce that i’m now an Edgeling. My first Edgelings article us up here.
What are P, NP-Complete, and NP-Hard?
I ended up writing this for someone on StackOverflow; thought I’d preserve it here too.
We start with the idea of a decision problem, a problem for which an algorithm can always answer “yes” or “no.” We also need the idea of two models of computer (Turing machine, really): deterministic and non-deterministic. A deterministic computer is [...]