Computational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarch
Thursday, July 16, 2009
Our First Complexity Vidcast
Live from the 24th CCC conference in Paris, Bill, Lance and special guests talk about our firsts in our first vidcast. I apologize for the audio quality.
First interesting theorem: Pythagorean theorem (I was about 8) First interesting theorem in grad school: n log n lower bound for comparison-based sorting (I wasn't a CS major) Idea for the next videocast: walking through Luxembourg Gardens.
Well, a vidcast can be subtitled - any volunteers?
ReplyDeleteThanks. Having never met Bill, I was surprised that he wasn't capitalizing everything. :)
ReplyDeleteFirst interesting theorem: Pythagorean theorem (I was about 8)
ReplyDeleteFirst interesting theorem in grad school: n log n lower bound for comparison-based sorting (I wasn't a CS major)
Idea for the next videocast: walking through Luxembourg Gardens.
Lesson learned: If you're in the wrong place at the wrong time, you might end up on YouTube.
ReplyDelete