He was 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, was unlikely to answer many of the important problems in computational complexity theory.

[5] Rudich (and Merrick Furst, now a Distinguished Professor at the Georgia Institute of Technology) began the Leap@CMU (formerly called Andrew's Leap) summer enrichment program for high school (and occasionally, middle school) students in 1991.

Most days, there is also an afternoon lecture by a Carnegie Mellon University faculty member.

This assessment is supposed to gauge ability to think outside the box, and aptitude for computer-related math.