Education
Cornell University; Yale University.
engineer mathematician university professor computer scientist
Cornell University; Yale University.
He is one of the key developers of descriptive complexity, an approach he is currently applying to research in model checking, database theory, and computational complexity theory. Professor Immerman is an editor of the Society for Industrial and Applied Mathematics Journal on Computing and of Logical Methods in Computer Science. His book "Descriptive Complexity" appeared in 1999.
Immerman is an Association for Computing Machinery (ACM) Fellow and a Guggenheim Fellow.
He received Bachelor of Surgery and Master of Surgery degrees from Yale University in 1974 and his Doctor of Philosophy from Cornell University in 1980 under the supervision of Juris Hartmanis, a Turing award winner at Cornell. Immerman is the winner, jointly with Róbert Szelepcsényi, of the 1995 Gödel Prize in theoretical computer science for proof of what is known as the Immerman–Szelepcsényi theorem, the result that nondeterministic space complexity classes are closed under complementation.