- Steven Rudich
Steven Rudich (born
Oct 4 1961 ) is a professor in theCarnegie Mellon School of Computer Science . In1994 , He andAlexander Razborov proved that a large class of combinatorial arguments, dubbednatural proof s were unlikely to answer many of the important problems incomputational complexity theory . For this work, they were awarded theGödel prize in2007 .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.Fact|date=October 2007 He is an editor of theJournal of Cryptology , as well as an accomplished magician.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.
External links
* [http://www.cs.cmu.edu/~leap/ Andrews' Leap Homepage] .
* [http://andrewsleap.blogspot.com/ Andrews' Leap Blog] .
* [http://dblp.uni-trier.de/db/indices/a-tree/r/Rudich:Steven.html DBLP: Steven Rudich] .
* [http://www.cs.cmu.edu/~rudich/ Home page at Carnegie Mellon] .
Wikimedia Foundation. 2010.
