Wednesday, January 09, 2008

Favourite Quote for the Day

Loosely speaking we can think of automata, grammar and computability as the study of what can be done by computers in principle, while complexity addresses what can be done in practice.
Peter Linz
at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Ranking and Unranking permutations

I've been a big fan of Skiena's Algorithm Design Manual , I recently found my first edition of the book (although I own the third ed...

  • Time out, take a break, Dravid!
    (Photo from http://content-usa.cricinfo.com/indvaus2008/content/current/player/28114.html) Dravid's dismal form continues in test crick...
  • Lagrange's interpretation in python
    I've been reading up on Fast Fourier Transform (FFT) from several books on algorithms that I have, TCLR, Tamassia, Sahni, Numerical Rec...
  • Be a role model
    I still remember meeting a great architect at a place I worked. He was very humble and so good that he was a role model. Basically whether w...