Steven Rudich
From Wikipedia, the free encyclopedia
Steven Rudich (born Oct 4, 1961) is a professor in the Carnegie Mellon School of Computer Science. In 1994, He and Alexander Razborov proved that a large class of combinatorial arguments, dubbed natural proofs were unlikely to answer many of the important problems in computational complexity theory. For this work, they were awarded the Gödel prize in 2007.
Amongst Carnegie Mellon students, he is best known as the teacher of the class 'Great Theoretical Ideas in Computer Science' (formerly named 'How to Think Like a Computer Scientist'), often considered one of the most difficult classes in the undergraduate computer science curriculum.[citation needed] He is an editor of the Journal of Cryptology, as well as an accomplished magician.
[edit] Andrews' Leap
Professor Rudich began the Andrews' Leap summer enrichment program for high school (and occasionally, middle school) students in 1991. The summer enrichment program focuses mainly on theoretical aspects of Computer Science in the morning, followed by lunch recess, and then an elective -- Robotics, Programming, or Math Theory. Most days, there is also an afternoon lecture by a Carnegie Mellon University faculty member.
In order to be enrolled in Andrews' Leap, one must take a specialized test known as The Interesting Test. This assessment gauges one's ability to think outside the box, and one's aptitude for Computer-related math.
[edit] External links
|
|||||
