Herbert A. Simon Award for Teaching Excellence 2007School of Computer Science, Carnegie Mellon University Pittsburgh PA 15213-3891 (412)268-8525 . (412)268-5576 (fax)
A Word of Thanks for The Herbert A. Simon Teaching Award
1. I try to teach well because of the terrible lows I get when I don't, and the highs I get when I do. The highs and lows of research are at least as impressive, though in a different way. I'm lucky to be both teacher and researcher: that way, if one isn't going well, there's still a chance the other will.
2. I am awed by the quality and dedication of my fellow teachers, and astonished that I am considered on a par with them. This semester I taught an undergraduate algorithms course, 451. I am thankful to my TAs who did the really hard work in the course. They did everything except the fun part – the lectures – which I selfishly did myself. These really great TAs are Elisabeth Crawford, Michelle Goodstein, Virginia Vassilevska, and Brent Bryan. I want most especially to thank my son, Carnegie Mellon Computer Science Professor Avrim Blum, for supporting my desire to teach his 451 algorithms course...his way. I've taught algorithms before, and I could have taught this course my own way. It would have been easier for me, but different, and not nearly as exciting. This course this time was based entirely on Avrim's ideas, his text, his homeworks, his schedule, his quizzes, his exams,.... Thank you Avrim! It blows me away how much information you manage to convey: roughly twice what I put out doing it my way. I like very much what you do and how you do it.
3. Everything I learned came to me...slowly:
*1st grade:*The meaning of number. 3 apartment buildings versus 7 cherries: cherries small; buildings big. How could there be more cherries than apartment buildings? Oh wow! Counting doesn't necessarily have to do with size!*2nd grade:*how to tell right from left? I write with my right hand! My first mnemonic.*High school combinatorics:*How does one count the number of necklaces with 7 red, 5 orange, and 3 yellow beads? I should have developed a general method (formula?), and then tested my method of counting on special cases, like the trivial necklace with 1 black bead and 1 white bead. But that didn't occur to me...and it wouldn't until many years later.*College Freshman year:*I got a D+ in physics, despite that I worked terribly hard at it. I worked hard but got nowhere until a friend, Bob Hertel, caught me hunched over my book, memorizing formulas.*"You don't memorize formulas: you derive them when you need them...from first principles!"*Oh my God, I didn't know that! Those words – from a peer – made all the difference to me.*College Sophomore year:*A (different) friend offers a steak dinner to whoever can solve the problem^{*}of the 5 shipwrecked sailors, the monkey, and the coconuts: how many coconuts? It took me a whole Thanksgiving to construct an answer. I was so proud. But the answer wasn't minimal. So no steak dinner. Only much later would I realize that to answer this problem, one best start small. Assume just 3 sailors, and if that's too many, try 2, or even just 1. Hey, that works for all those probability and combinatorics problems from high school too!
| |

Return to: SCS Faculty Awards |